Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

SSD
1993
Springer

favoriteEmaildiscussreport

91views Database» more SSD 1993»

Volumes From Overlaying 3-D Triangulations in Parallel

13 years 8 months ago

Volumes From Overlaying 3-D Triangulations in Parallel

Download www.ecse.rpi.edu

Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for ﬁnding the volumes of the intersections of all overlapping pairs of tetrahedra. The algorithm should parallelize easily, based on our experience with similar algorithms. One application for this is, when given data in terms of one triangulation,to approximate it in terms of the other triangulation. One part of this algorithm is useful by itself. That is to locate a large number of points in a triangulation, by ﬁnding which tetrahedron contains each point.

Wm. Randolph Franklin, Mohan S. Kankanhalli

Real-time Traffic

Algorithm | Database | Similar Algorithms | SSD 1993 | Triangulation |

claim paper

Related Content

» Compatible Triangulations of Spatial Decompositions

» Fast Joint Estimation of Silhouettes and Dense 3D Geometry from Multiple Images

» Active Volume Models for 3D Medical Image Segmentation

» Extremal feature extraction from 3D vector and noisy scalar fields

» Parallel 3D Image Segmentation of Large Data Sets on a GPU Cluster

» Homography Based Parallel Volume Intersection Toward RealTime Volume Reconstruction using ...

» Improving architectural 3D reconstruction by plane and edge constraining

» Registration of 3D Angiographic and XRay Images Using Sequential Monte Carlo Sampling

» 3D surface models by geometric constraints propagation

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	SSD
Authors	Wm. Randolph Franklin, Mohan S. Kankanhalli

Comments (0)