138 search results - page 8 / 28 » K-Guarding Polygons on the Plane |
57
Voted
ISAAC
2003
Springer
15 years 3 months ago
2003
Springer
Fixed-angle polygonal chains in 3D serve as an interesting model of protein backbones. Here we consider such chains produced inside a “machine” modeled crudely as a cone, and e...
93
Voted
COMPGEOM
1990
ACM
15 years 2 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
82
Voted
ECCV
2002
Springer
16 years 2 days ago
2002
Springer
Abstract. We investigate a strategy for reconstructing of buildings from multiple (uncalibrated) images. In a similar manner to the Facade approach we first generate a coarse piece...
83
Voted
CCCG
2006
14 years 11 months ago
2006
We introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monotone with respect to a point r if there exists a partitioning of the boundary of P into ex...
100
Voted
JGAA
2008
14 years 10 months ago
2008
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex gr...