Sciweavers

98 search results - page 4 / 20
» A Rectilinearity Measurement for Polygons
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
14 years 9 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac
GIS
1995
ACM
15 years 3 months ago
Measuring the Complexity of Polygonal Objects
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
95
Voted
CCCG
1998
15 years 1 months ago
On measuring areas of polygons
Jurek Czyzowicz, F. Contreras-Alcalá, Jorge...
73
Voted
DCG
2002
68views more  DCG 2002»
14 years 11 months ago
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping
Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, ...
122
Voted
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
15 years 5 months ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
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...
Matthias Müller-Hannemann, Siamak Tazari