Sciweavers

46 search results - page 3 / 10
» Exploring Simple Grid Polygons
Sort
View
PAMI
2002
103views more  PAMI 2002»
13 years 8 months ago
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
Thomas Bülow, Reinhard Klette
VISUALIZATION
2002
IEEE
14 years 1 months ago
Exploring Surface Characteristics with Interactive Gaussian Images (A Case Study)
The Gauss map projects surface normals to a unit sphere, providing a powerful visualization of the geometry of a graphical object. It can be used to predict visual events caused b...
Bradley C. Lowekamp, Penny Rheingans, Terry S. Yoo
SMA
2010
ACM
187views Solid Modeling» more  SMA 2010»
13 years 8 months ago
Polygonizing extremal surfaces with manifold guarantees
Extremal surfaces are a class of implicit surfaces that have been found useful in a variety of geometry reconstruction applications. Compared to iso-surfaces, extremal surfaces ar...
Ruosi Li, Lu Liu, Ly Phan, Sasakthi S. Abeysinghe,...
DAGSTUHL
1997
13 years 10 months ago
Simple, Fast, and Robust Ray Casting of Irregular Grids
In this paper we describe a simple and efficient ray casting engine that is suitable for the rapid exploration of irregular grids composed of tetrahedra cells, or other cell comp...
Paul Bunyk, Arie E. Kaufman, Cláudio T. Sil...
ICIP
2007
IEEE
14 years 10 months ago
Fast and High Resolution 3D Face Scanning
In this work, we present a framework to capture 3D models of faces in high resolutions with low computational load. The system captures only two pictures of the face, one illumina...
Philipp Fechteler, Peter Eisert, Jürgen Rurai...