Sciweavers

94 search results - page 11 / 19
» Minimum-Perimeter Intersecting Polygons
Sort
View
VRST
2003
ACM
13 years 12 months ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
GISCIENCE
2008
Springer
115views GIS» more  GISCIENCE 2008»
13 years 7 months ago
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
Abstract. Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersectin...
Edward Verbree, Hang Si
VRML
1997
ACM
13 years 11 months ago
QOTA: A Fast, Multi-Purpose Algorithm for Terrain Following in Virtual Environments
To keep avatars and other moving objects on the ground in virtual environments, it is necessary to find the points where these objects should contact the terrain. This is often do...
John W. Barrus, Richard C. Waters
SGP
2003
13 years 8 months ago
3D Reconstruction Using Labeled Image Regions
In this paper we present a novel algorithm for reconstructing 3D scenes from a set of images. The user defines a set of polygonal regions with corresponding labels in each image ...
Remo Ziegler, Wojciech Matusik, Hanspeter Pfister,...
SIGGRAPH
1997
ACM
13 years 10 months ago
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
Frédo Durand, George Drettakis, Claude Puec...