Sciweavers

2756 search results - page 246 / 552
» Parallel Mesh Generation
Sort
View
ICALP
1991
Springer
15 years 5 months ago
The Expected Extremes in a Delaunay Triangulation
We give an expected-case analysis of Delaunay triangulations. To avoid edge effects we consider a unit-intensity Poisson process in Euclidean d-space, and then limit attention to...
Marshall W. Bern, David Eppstein, F. Frances Yao
SGP
2007
15 years 4 months ago
Unconstrained isosurface extraction on arbitrary octrees
This paper presents a novel algorithm for generating a watertight level-set from an octree. We show that the levelset can be efficiently extracted regardless of the topology of th...
Michael M. Kazhdan, Allison Klein, Ketan Dalal, Hu...
WSCG
2004
166views more  WSCG 2004»
15 years 3 months ago
Non-evaluated Manipulation of Complex CSG Solids
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
Rafael Jesús Segura, Francisco R. Feito, Ju...
WSCG
2004
142views more  WSCG 2004»
15 years 3 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
VMV
2003
170views Visualization» more  VMV 2003»
15 years 3 months ago
Performance Analysis of Nearest Neighbor Algorithms for ICP Registration of 3-D Point Sets
There are many nearest neighbor algorithms tailormade for ICP, but most of them require special input data like range images or triangle meshes. We focus on efficient nearest nei...
Timo Zinßer, Jochen Schmidt, Heinrich Nieman...