Sciweavers

28 search results - page 2 / 6
» An interactive approach to point cloud triangulation
Sort
View
CGF
2000
155views more  CGF 2000»
13 years 5 months ago
Surface Reconstruction Based on Lower Dimensional Localized Delaunay Triangulation
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3 . Nothing is assumed about the geometry,...
M. Gopi, Shankar Krishnan, Cláudio T. Silva
CGF
2004
165views more  CGF 2004»
13 years 5 months ago
Point Cloud Collision Detection
In the past few years, many efficient rendering and surface reconstruction algorithms for point clouds have been developed. However, collision detection of point clouds has not be...
Jan Klein, Gabriel Zachmann
COMPGEOM
2009
ACM
13 years 12 months ago
High resolution surface reconstruction from overlapping multiple-views
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us...
Nader Salman, Mariette Yvinec
CGI
2009
IEEE
13 years 9 months ago
Visual analytics of time dependent 2D point clouds
Two dimensional point data can be considered one of the most basic, yet one of the most ubiquitous data types arising in a wide variety of applications. The basic scatter plot app...
Tatiana von Landesberger, Sebastian Bremm, Peyman ...
VIS
2008
IEEE
161views Visualization» more  VIS 2008»
14 years 6 months ago
Brushing of Attribute Clouds for the Visualization of Multivariate Data
The visualization and exploration of multivariate data is still a challenging task. Methods either try to visualize all variables simultaneously at each position using glyph-based ...
Heike Jänicke, Michael Böttinger, Gerik Scheue...