501 search results - page 68 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
DMTCS
2010
13 years 5 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
FCT
2003
Springer
14 years 25 days ago
2003
Springer
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of tr...
CCCG
2010
13 years 9 months ago
2010
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...