Sciweavers

676 search results - page 73 / 136
» A Search-Free Intersection Algorithm
Sort
View
ISAAC
2007
Springer
80views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Geometric Streaming Algorithms with a Sorting Primitive
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
Eric Y. Chen
GMP
2000
IEEE
117views Solid Modeling» more  GMP 2000»
14 years 2 months ago
Distance Computation between Non-Convex Polyhedra at Short Range Based on Discrete Voronoi Regions
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
Katsuaki Kawachi, Hiromasa Suzuki
COMPGEOM
2005
ACM
13 years 12 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner
GRAPHICSINTERFACE
2003
13 years 11 months ago
Multi-Resolution Point-Sample Raytracing
We propose a new strategy for raytracing complex scenes without aliasing artifacts. The algorithm intersects anisotropic ray cones with prefiltered surface sample points from a mu...
Michael Wand, Wolfgang Straßer
AUTOMATICA
2006
64views more  AUTOMATICA 2006»
13 years 10 months ago
On the facet-to-facet property of solutions to convex parametric quadratic programs
In some of the recently-developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regio...
Jørgen Spjøtvold, Eric C. Kerrigan, ...