Download:
by John J. Bartholdi, Iii Paul Goldsman
http://www.isye.gatech.edu/~jjb/mow/Bartholdi-Goldsman-I.pdf
Add To MetaCart
Abstract:
We show how to build a continuous, one-dimensional index of the points on a triangulated, two-dimensional manifold T. The index is constructed by quickly finding a vertex-adjacent ordering of the triangles (that is, sequential triangles share at least one vertex). Then the space within triangles is indexed with a spacefilling curve oriented so that the lowest point in each triangle is the vertex shared with the preceding triangle, and the highest point is the vertex shared with the next triangle. This index is a continuous circuit of T if the first and last points coincide, otherwise it is a continuous path. We show that when two triangulations with continuous circuits share an edge, then a continuous circuit can be created through their union. A continuous circuit is easily created through any pair or triple of edge-adjacent triangles. Therefore, if T can be partitioned into pairs and triples, a continuous circuit of T can be created by finding circuits in these sub-triangulations, and then combining them. This is possible in all but exceptional cases; in those cases, a continuous path can be found.
Citations
|
899
|
Graph Theory with Applications
– Bondy, Murty
- 1976
|
|
240
|
Triangle mesh compression
– Touma, Gotsman
- 1998
|
|
201
|
Edgebreaker: Connectivity compression for triangle meshes
– Rossignac
- 1999
|
|
147
|
Fundamentals of Spatial Information Systems
– Laurini, Thompson
- 1992
|
|
97
|
Preparata and Michael Ian Shamos, Computational Geometry - An Introduction (Corrected and Expended Third Printing
– Franco
- 1990
|
|
60
|
Hamiltonian triangulations for fast rendering
– Arkin, Held, et al.
- 1994
|
|
29
|
Triangle strip compression
– Isenburg
- 2000
|
|
22
|
Taubin and Jarek Rossignac. Geometric compression through topological surgery
– Gabriel
- 1998
|
|
15
|
An O(N log N) Planar Travelling Salesman Heuristic Based On Spacefilling Curves
– Bartholdi, Platzman
- 1982
|
|
9
|
Heuristics based on spacefilling curves for combinatorial problems in Euclidean space
– Bartholdi, Platzman
- 1988
|
|
6
|
Ueber die stetige abbildung einer linie auf ein achenstueck
– Hilbert
- 1891
|
|
5
|
Continuous indexing of hierarchical subdivisions of the globe
– Bartholdi, Goldsman
- 2001
|
|
5
|
Sur une nouvelle courbe qui remplit toute une aire plaine
– Sierpinski
- 1912
|
|
4
|
A minimal technology routing system for meals-on-wheels
– Bartholdi, Platzman, et al.
- 1983
|
|
3
|
Sur une courbe qui remplit toute en aire plaine
– Peano
|
|
2
|
Geometric Searching with Spacefilling Curves
– Nulty
- 1993
|
|
2
|
Bartholdi III. Spacefilling curves and the planar travelling salesman problem
– Platzman, John
- 1989
|
|
1
|
Robust spatial searching with spacefilling curves
– Nulty, Bartholdi
- 1994
|
