138 search results - page 3 / 28 » K-Guarding Polygons on the Plane |
DGCI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Reversible polyhedral modelling of discrete objects is an important issue to handle those objects. We propose a new algorithm to compute a polygonal face from a discrete ...
CCCG
1998
13 years 9 months ago
1998
Let S be any family of n c-oriented polygons of the two-dimensional Euclidean plane E2 , i.e., bounded intersection of halfplanes whose normal directions of edges belong to a
WADS
2007
Springer
14 years 1 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...
SMI
2006
IEEE
14 years 1 months ago
2006
IEEE
We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches ...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...