Sciweavers

1557 search results - page 38 / 312
» On measuring areas of polygons
Sort
View
STACS
1999
Springer
15 years 10 months ago
An Optimal Competitive Strategy for Walking in Streets
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally ...
Christian Icking, Rolf Klein, Elmar Langetepe
CCCG
2003
15 years 7 months ago
Curves of width one and the river shore problem
We consider the problem of finding the shortest curve in the plane that has unit width. This problem was first posed as the “river shore” puzzle by Ogilvy (1972) and is rela...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
SIGACT
2008
103views more  SIGACT 2008»
15 years 6 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke
GIS
2009
ACM
15 years 10 months ago
Focus+Glue+Context: an improved fisheye approach for web map services
This paper proposes a method for generating a Focus+Glue +Context map for Web map services by improving existing fisheye views methods for cartographic data. While many studies h...
Daisuke Yamamoto, Shotaro Ozeki, Naohisa Takahashi
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
15 years 7 months ago
Comparing top k lists
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
Ronald Fagin, Ravi Kumar, D. Sivakumar