44 search results - page 2 / 9 » Dynamic Planar Convex Hull |
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
DCG
2007
14 years 10 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
CORR
2002
Springer
14 years 10 months ago
2002
Springer
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
DIMACS
2001
14 years 11 months ago
2001
Abstract. One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family o...
149
click to vote
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...