584 search results - page 21 / 117 » On the Number of Halving Planes |
FSTTCS
2007
Springer
14 years 3 months ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
GD
2007
Springer
14 years 3 months ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
WADS
2007
Springer
14 years 3 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
CVPR
2012
IEEE
12 years 5 days ago
2012
IEEE
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...