208 search results - page 19 / 42 » Blocking delaunay triangulations |
CPHYSICS
2011
13 years 2 months ago
2011
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
SIROCCO
2001
13 years 8 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
VIS
2007
IEEE
14 years 8 months ago
2007
IEEE
Abstract-This paper describes a method for constructing isosurface triangulations of sampled, volumetric, three-dimensional scalar fields. The resulting meshes consist of triangles...
VIS
2004
IEEE
14 years 8 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...