Sciweavers

346 search results - page 13 / 70
» Isodiametric Problems for Polygons
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 4 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
ESA
2007
Springer
133views Algorithms» more  ESA 2007»
14 years 1 months ago
Order Statistics in the Farey Sequences in Sublinear Time
We present the rst sublinear-time algorithms for computing order statistics in the Farey sequence and for the related problem of ranking. Our algorithms achieve a running times o...
Jakub Pawlewicz
COMPGEOM
2003
ACM
14 years 19 days ago
Finding a curve in a map
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran ...
CGF
1999
123views more  CGF 1999»
13 years 7 months ago
Computer-Generated Graphite Pencil Rendering of 3D Polygonal Models
Researchers in non-photorealistic rendering have investigated the display of three-dimensional worlds using various display models. In particular, recent work has focused on the m...
Mario Costa Sousa, John W. Buchanan
CCCG
2008
13 years 8 months ago
Draining a Polygon - or - Rolling a Ball out of a Polygon
We introduce the problem of draining water (or balls representing water drops) out of a punctured polygon (or a polyhedron) by rotating the shape. For 2D polygons, we obtain combi...
Greg Aloupis, Jean Cardinal, Sébastien Coll...