Sciweavers

279 search results - page 14 / 56
» Implicit Convex Polygons
Sort
View
DCG
2006
101views more  DCG 2006»
13 years 7 months ago
Isodiametric Problems for Polygons
The maximal area of a polygon with n = 2m edges and unit diameter is not known when m 5, nor is the maximal perimeter of a convex polygon with n = 2m edges and unit diameter known...
Michael J. Mossinghoff
CCCG
2010
13 years 9 months ago
On polygons excluding point sets
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
Radoslav Fulek, Balázs Keszegh, Filip Moric...
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
14 years 1 months ago
Proximity Queries between Convex Objects: an Interior Point Approach for Implicit Surfaces
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
Nilanjan Chakraborty, Jufeng Peng, Srinivas Akella...
CCCG
2006
13 years 9 months ago
Rotationally Monotone Polygons
We introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monotone with respect to a point r if there exists a partitioning of the boundary of P into ex...
Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Ste...
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 7 months ago
Curve Shortening and the Rendezvous Problem for Mobile Autonomous Robots
If a smooth, closed, and embedded curve is deformed along its normal vector field at a rate proportional to its curvature, it shrinks to a circular point. This curve evolution is ...
Stephen L. Smith, Mireille E. Broucke, Bruce A. Fr...