Sciweavers

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

8

IWCIA
2004
Springer

favoriteEmaildiscussreport

83views Image Analysis» more IWCIA 2004»

Convex Hulls in a 3-Dimensional Space

13 years 10 months ago

Convex Hulls in a 3-Dimensional Space

Download www.kovalevsky.de

This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm stract polyhedron being described by a new data structure, the cell list, suggested by one of the authors. The correctness of the algorithm is proved and experimental results are presented.

Vladimir Kovalevsky, Henrik Schulz

Real-time Traffic

3-dimensional Object | Algorithm Stract Polyhedron | Convex Hull | IWCIA 2004 |

claim paper

Related Content

» The convex hull of ellipsoids

» Three problems about dynamic convex hulls

» Search Space Partitioning Using Convex Hull and Concavity Features for Fast Medical Image ...

» Using convex hulls to represent classifier conditions

» Convexity in Discrete Space

» How to Exhibit Toroidal Maps in Space

» Color Gamut Characterization Via Ray Tracing for Device Profile Generation

» Sparse Recovery in Convex Hulls of Infinite Dictionaries

» Kinetic Collision Detection for Convex Fat Objects

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	IWCIA
Authors	Vladimir Kovalevsky, Henrik Schulz

Comments (0)