Sciweavers

1879 search results - page 265 / 376
» Computational geometry algorithms library
Sort
View
EGH
2011
Springer
14 years 4 months ago
Simpler and Faster HLBVH with Work Queues
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
Kirill Garanzha, Jacopo Pantaleoni, David K. McAll...
COMPGEOM
2010
ACM
15 years 9 months ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
15 years 9 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
CVPR
2000
IEEE
16 years 6 months ago
Reconstruction from Six-Point Sequences
An algorithm is given for computing projective structure from a set of six points seen in a sequence of many images. The method is based on the notion of duality between cameras a...
Richard I. Hartley, Nicolas Y. Dano
GRAPHITE
2006
ACM
15 years 10 months ago
GPU-based rendering of sparse low-degree implicit surfaces
Implicit surface is a well-known surface representation. Geometric details of an object can be represented using less surface primitives than other representations such as polygon...
Takashi Kanai, Yutaka Ohtake, Hiroaki Kawata, Kiwa...