Sciweavers

140 search results - page 9 / 28
» Computing the visibility graph of points within a polygon
Sort
View
CVPR
2005
IEEE
16 years 1 months ago
Visibility Constrained Surface Evolution
The problem of feature-based surface reconstruction is considered in this paper. Our main contribution is the ability to handle visibility constraints, obtained from the projectio...
Jan Erik Solem, Fredrik Kahl, Anders Heyden
CGF
2002
156views more  CGF 2002»
14 years 11 months ago
Object Space EWA Surface Splatting: A Hardware Accelerated Approach to High Quality Point Rendering
Elliptical weighted average (EWA) surface splatting is a technique for high quality rendering of point-sampled 3D objects. EWA surface splatting renders water-tight surfaces of co...
Liu Ren, Hanspeter Pfister, Matthias Zwicker
SODA
2001
ACM
126views Algorithms» more  SODA 2001»
15 years 1 months ago
Static and kinetic geometric spanners with applications
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
Menelaos I. Karavelas, Leonidas J. Guibas
CHI
2008
ACM
16 years 1 days ago
Peephole pointing: modeling acquisition of dynamically revealed targets
Peephole interaction occurs when a spatially aware display is moved and acts as a viewport to reveal different parts of the virtual space that cannot all fit within the display at...
Xiang Cao, Jacky Jie Li, Ravin Balakrishnan
COMGEO
2008
ACM
14 years 11 months ago
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
Robert L. Scot Drysdale, Günter Rote, Astrid ...