1245 search results - page 9 / 249 » Triangulation for Points on Lines |
115
Voted
VIS
2004
IEEE
15 years 10 months ago
2004
IEEE
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
ESA
2000
Springer
15 years 1 months ago
2000
Springer
For a set P of points in the plane, we introduce a class of triangulations that is an extension of the Delaunay triangulation. Instead of requiring that for each triangle the circ...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
SSD
1993
Springer
15 years 1 months ago
1993
Springer
Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for finding the volumes of the i...
GD
2005
Springer
15 years 3 months ago
2005
Springer
