1245 search results - page 15 / 249 » Triangulation for Points on Lines |
100
click to vote
CCCG
2010
15 years 3 months ago
2010
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjo...
161
Voted
GM
1999
Springer
15 years 6 months ago
1999
Springer
In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for cons...
138
click to vote
CPHYSICS
2004
15 years 1 months ago
2004
We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only go...
102
click to vote
CCCG
2003
15 years 3 months ago
2003
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside t...
116
Voted
CCCG
2008
15 years 3 months ago
2008
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....