346 search results - page 58 / 70 » Isodiametric Problems for Polygons |
CCCG
2006
13 years 8 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
SODA
2003
ACM
13 years 8 months ago
2003
ACM
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
WSCG
2003
13 years 8 months ago
2003
Modelling Large Urban Environments using traditional modelling techniques would prove too time consuming a process. Consequently a method is required for generating large urban en...
CG
2008
Springer
13 years 7 months ago
2008
Springer
We address the problem of an efficient image-space reconstruction of adaptively sampled scenes in the context of point-based and line-based graphics. The imagespace reconstruction...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...