Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition.
Stephen A. EhmannMing C. LinPublished in: Comput. Graph. Forum (2001)
Keyphrases
- convex hull
- web search engines
- query language
- response time
- query evaluation
- three dimensional
- d objects
- computationally efficient
- piecewise linear
- convex sets
- object surface
- special case
- query processing
- database
- user queries
- range data
- aggregate queries
- extreme points
- shape decomposition
- globally optimal
- convex polyhedra
- search queries
- query logs
- range queries
- high accuracy
- high quality
- image sequences
- databases