Sciweavers

413 search results - page 52 / 83
» Computing Distances between Surfaces Using Line Geometry
Sort
View
73
Voted
APVIS
2008
14 years 11 months ago
Height Ridge Computation and Filtering for Visualization
Motivated by the growing interest in the use of ridges in scientific visualization, we analyze the two height ridge definitions by Eberly and Lindeberg. We propose a raw feature d...
Ronald Peikert, Filip Sadlo
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
15 years 4 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
92
Voted
CVPR
2003
IEEE
15 years 2 months ago
A Perspective on Distortions
A framework for analyzing distortions in non-single viewpoint imaging systems is presented. Such systems possess loci of viewpoints called caustics. In general, perspective (or un...
Rahul Swaminathan, Michael D. Grossberg, Shree K. ...
VISUALIZATION
1997
IEEE
15 years 1 months ago
Simplifying polygonal models using successive mappings
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
Jonathan D. Cohen, Dinesh Manocha, Marc Olano
STACS
2001
Springer
15 years 2 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid