Sciweavers

133 search results - page 22 / 27
» The intersection of two ruled surfaces
Sort
View
FOCS
1997
IEEE
13 years 11 months ago
The Computational Complexity of Knot and Link Problems
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
Joel Hass, J. C. Lagarias, Nicholas Pippenger
CGF
2006
115views more  CGF 2006»
13 years 7 months ago
Reflected-Scene Impostors for Realistic Reflections at Interactive Rates
We present a technique for rendering reflections on complex reflectors at interactive rates based on approximating the geometry of the reflected scene with impostors. The reflecti...
Voicu Popescu, Chunhui Mei, Jordan Dauble, Elisha ...
TIP
2008
90views more  TIP 2008»
13 years 7 months ago
Synthetic Aperture Hitchhiker Imaging
We introduce a novel synthetic-aperture imaging method for radar systems that rely on sources of opportunity. We consider receivers that fly along arbitrary, but known, flight traj...
Can Evren Yarman, Birsen Yazici
SMI
2005
IEEE
117views Image Analysis» more  SMI 2005»
14 years 1 months ago
Contouring 1- and 2-Manifolds in Arbitrary Dimensions
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
SIGGRAPH
2010
ACM
13 years 12 months ago
Feature-aligned T-meshes
High-order and regularly sampled surface representations are more efficient and compact than general meshes and considerably simplify many geometric modeling and processing algor...
Ashish Myles, Nico Pietroni, Denis Kovacs, Denis Z...