70 search results - page 4 / 14 » On Convex Quadrangulations of Point Sets on the Plane |
72
Voted
CCCG
2009
14 years 10 months ago
2009
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
104
click to vote
ORDER
2011
14 years 4 months ago
2011
We prove a Hadwiger transversal type result, characterizing convex position on a family of non-crossing convex bodies in the plane. This theorem suggests a definition for the ord...
96
Voted
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...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...