895 search results - page 15 / 179 » Triangulating Topological Spaces |
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
NIPS
1996
13 years 8 months ago
1996
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
SIGGRAPH
2000
ACM
13 years 11 months ago
2000
ACM
Most schemes to compress the topology of a surface mesh have been developed for the lowest common denominator: triangulated meshes. We propose a scheme that handlesthe topology of...
COMPUTING
2004
13 years 7 months ago
2004
Parameterization of 3D mesh data is important for many graphics and mesh processing applications, in particular for texture mapping, remeshing and morphing. Closed, manifold, genu...
IJCGA
2002
13 years 7 months ago
2002
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...