Sciweavers

1145 search results - page 104 / 229
» Discrete Green's Functions
Sort
View
COMPGEOM
2004
ACM
15 years 10 months ago
Intersecting quadrics: an efficient and exact implementation
We present the first complete, exact, and efficient C++ implementation for parameterizing the intersection of two implicit quadrics with integer coefficients of arbitrary size. It...
Sylvain Lazard, Luis Mariano Peñaranda, Syl...
COMPGEOM
2008
ACM
15 years 8 months ago
Locally uniform anisotropic meshing
Anisotropic meshes are triangulations of a given domain in the plane or in higher dimensions, with elements elongated along prescribed directions. Anisotropic triangulations have ...
Jean-Daniel Boissonnat, Camille Wormser, Mariette ...
DEXA
2008
Springer
154views Database» more  DEXA 2008»
15 years 8 months ago
Approximate Range-Sum Queries over Data Cubes Using Cosine Transform
In this research, we propose to use the discrete cosine transform to approximate the cumulative distributions of data cube cells' values. The cosine transform is known to have...
Wen-Chi Hou, Cheng Luo, Zhewei Jiang, Feng Yan, Qi...
DGCI
2008
Springer
15 years 8 months ago
About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators
In this paper we prove that the function giving the frequency of a class of patterns of digital planes with respect to the slopes of the plane is continuous and piecewise affine, m...
Alain Daurat, Mohamed Tajine, Mahdi Zouaoui
EJC
2007
15 years 6 months ago
Chords of longest circuits in locally planar graphs
It was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math. 27 (1985)], p. 466) that every longest circuit of a 3-connected graph must have a cho...
Ken-ichi Kawarabayashi, Jianbing Niu, Cun-Quan Zha...