Sciweavers

676 search results - page 41 / 136
» A Search-Free Intersection Algorithm
Sort
View
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 10 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro
CGF
2005
69views more  CGF 2005»
13 years 9 months ago
Structure Preserving CAD Model Repair
There are two major approaches for converting a tessellated CAD model that contains inconsistencies like cracks or intersections into a manifold and closed triangle mesh. Surface ...
Stephan Bischoff, Leif Kobbelt
IJCV
1998
81views more  IJCV 1998»
13 years 9 months ago
Estimating the Focus of Expansion in Analog VLSI
In the course of designing an integrated system for locating the focus of expansion (FOE) from a sequence of images taken while a camera is translating, a variety of direct motion ...
Ignacio S. McQuirk, Berthold K. P. Horn, Hae-Seung...
CGF
2010
135views more  CGF 2010»
13 years 6 months ago
Interactive Rendering of Non-Constant, Refractive Media Using the Ray Equations of Gradient-Index Optics
Existing algorithms can efficiently render refractive objects of constant refractive index. For a medium with a continuously varying index of refraction, most algorithms use the r...
Chen Cao, Zhong Ren, Baining Guo, Kun Zhou
ICFP
2004
ACM
14 years 9 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard