Sciweavers

31 search results - page 4 / 7
» An algorithm for the MaxMin area triangulation of a convex p...
Sort
View
COMGEO
1999
ACM
13 years 8 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
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
13 years 8 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...
ESA
2009
Springer
139views Algorithms» more  ESA 2009»
14 years 3 months ago
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 3 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
WSCG
2004
156views more  WSCG 2004»
13 years 10 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...