346 search results - page 5 / 70 » Isodiametric Problems for Polygons |
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
MOC
2000
13 years 7 months ago
2000
Abstract. We study the convergence properties of the cascadic conjugategradient method (CCG-method), which can be considered as a multilevel method without coarse-grid correction. ...
CCCG
2010
13 years 8 months ago
2010
A watchman tour in a polygonal domain (for short, polygon) is a closed curve such that every point in the polygon is visible from at least one point of the tour. The problem of fin...
ESA
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...