70 search results - page 9 / 14 » On Convex Quadrangulations of Point Sets on the Plane |
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
CCCG
1993
14 years 11 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
CCCG
2007
14 years 11 months ago
2007
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
116
click to vote
SMA
2009
ACM
15 years 4 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
69
Voted
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...