Sciweavers

83 search results - page 7 / 17
» Deflating polygons to the limit
Sort
View
COMGEO
2002
ACM
14 years 9 months ago
Quadtree, ray shooting and approximate minimum weight Steiner triangulation
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
Siu-Wing Cheng, Kam-Hing Lee
CAD
2011
Springer
14 years 4 months ago
Mesh repair with user-friendly topology control
Limitations of current 3D acquisition technology often lead to polygonal meshes exhibiting a number of geometrical and topological defects which prevent them from widespread use. ...
Franck Hétroy, Stéphanie Rey, Carlos...
SWAT
2010
Springer
218views Algorithms» more  SWAT 2010»
15 years 2 months ago
Optimal Exploration of Terrains with Obstacles
A mobile robot represented by a point moving in the plane has to explore an unknown terrain with obstacles. Both the terrain and the obstacles are modeled as arbitrary polygons. W...
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, ...
JSC
2007
68views more  JSC 2007»
14 years 9 months ago
Multiple object semilinear motion planning
We present a method based on extended linear real quantifier elimination for multiple object semilinear motion planning, i.e. finding collision-free trajectories for several rob...
Andreas Dolzmann, Volker Weispfenning
COMGEO
1999
ACM
14 years 9 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland