Sciweavers

59 search results - page 2 / 12
» An External Memory Data Structure for Shortest Path Queries
Sort
View
CCCG
2010
13 years 6 months ago
I/O efficient path traversal in well-shaped tetrahedral meshes
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ l...
Craig Dillabaugh
ICALP
1999
Springer
13 years 9 months ago
Online Data Structures in External Memory
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
Jeffrey Scott Vitter
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
13 years 10 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
DCG
2010
289views more  DCG 2010»
13 years 5 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
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...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
COMPGEOM
2007
ACM
13 years 9 months ago
Querying approximate shortest paths in anisotropic regions
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...