Optimal shortest path queries in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
Thinning Methodologies-A Comprehensive Survey
IEEE Transactions on Pattern Analysis and Machine Intelligence
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Convergence and continuity criteria for discrete approximations of the continuous planar skeleton
CVGIP: Image Understanding
The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
Crust and anti-crust: a one-step boundary and skeleton extraction algorithm
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Proceedings of the sixth ACM symposium on Solid modeling and applications
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
An Adaptive Algorithm to Compute the Medial Axis Transform of 2-D Polygonal Domains
CAD Systems Development: Tools and Methods [Dagstuhl Seminar, 1995]
An Adaptive Algorithm to Compute the Medial Axis Transform of 2-D Polygonal Domains
CAD Systems Development: Tools and Methods [Dagstuhl Seminar, 1995]
Winged edge polyhedron representation.
Winged edge polyhedron representation.
Efficient computation and data structures for graphics.
Efficient computation and data structures for graphics.
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
MAP: medial axis based geometric routing in sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Efficient query processing on unstructured tetrahedral meshes
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
A framework for data quality and feedback in participatory sensing
Proceedings of the 5th international conference on Embedded networked sensor systems
Data exploration of turbulence simulations using a database cluster
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Urban Computing and Mobile Devices
IEEE Pervasive Computing
SCOUT: prefetching for latent structure following queries
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We present a technique for organizing data in spatial databases with non-convex domains based on an automatic characterization using the medial-axis transform (MAT). We define a tree based on the MAT and enumerate its branches to partition space and define a linear order on the partitions. This ordering clusters data in a manner that respects the complex shape of the domain. The ordering has the property that all data down any branch of the medial axis, regardless of the geometry of the sub-region, are contiguous on disk. Using this data organization technique, we build a system to provide efficient data discovery and analysis of the observational and model data sets of the Chesapeake Bay Environmental Observatory (CBEO). On typical CBEO workloads in which scientists query contiguous substructures of the Chesapeake Bay, we improve query processing performance by a factor of two when compared with orderings derived from space filling curves.