28 search results - page 5 / 6 » On sequential triangulations of simple polygons |
IJRR
2002
13 years 7 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
WSCG
2003
13 years 8 months ago
2003
Large terrain databases require a great number of polygons and textures. In consequence, transmission of terrain data over slow networks is still worrying. Multiresolution models ...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
2010
Eurographics
We provide a simple method that extracts an isosurface that is manifold and intersection-free from a function over an arbitrary octree. Our method samples the function dual to min...
PPL
2006
13 years 7 months ago
2006
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...