CORR
2007
Springer
13 years 4 months ago
2007
Springer
We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quasigeodesic, and cutting all but a short segment of the quasigeodesic, unfolds th...
EOR
2006
13 years 4 months ago
2006
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
EJC
2008
13 years 4 months ago
2008
We provide bounds for the product of the lengths of distinguished shortest paths in a finite network induced by a triangulation of a topological planar quadrilateral.
DCG
2008
13 years 4 months ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
DEBU
2010
13 years 4 months ago
2010
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...
DCG
2010
13 years 4 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
DCG
2010
13 years 4 months ago
2010
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ...
SODA
2003
ACM
13 years 5 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
PUK
2003
13 years 5 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
CCCG
2003
13 years 5 months ago
2003
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectu...