Sciweavers

676 search results - page 92 / 136
» A Search-Free Intersection Algorithm
Sort
View
CCCG
1993
15 years 3 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
IPSN
2005
Springer
15 years 7 months ago
The sensor selection problem for bounded uncertainty sensing models
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
Volkan Isler, Ruzena Bajcsy
VISUALIZATION
1996
IEEE
15 years 6 months ago
Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids
A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Re...
Jane Wilhelms, Allen Van Gelder, Paul Tarantino, J...
SGP
2007
15 years 4 months ago
Shape reconstruction from unorganized cross-sections
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...
Jean-Daniel Boissonnat, Pooran Memari
SMA
2008
ACM
149views Solid Modeling» more  SMA 2008»
15 years 2 months ago
Exact arrangements on tori and Dupin cyclides
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...
Eric Berberich, Michael Kerber