Name
Abstract | ||
|---|---|---|
This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm is an abstract 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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30503-3_14 | IWCIA |
Keywords | Field | DocType |
cell list,3-dimensional object,convex hull,abstract polyhedron,3-dimensional space,new data structure,new algorithm,three dimensional,data structure,3 dimensional,computational geometry,connected component | Orthogonal convex hull,Discrete mathematics,Combinatorics,Convex combination,Computer science,Convex set,Convex hull,Convex polytope,Output-sensitive algorithm,Gift wrapping algorithm,Convex analysis | Conference |
Volume | ISSN | ISBN |
3322 | 0302-9743 | 3-540-23942-1 |
Citations | PageRank | References |
3 | 0.44 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vladimir Kovalevsky | 1 | 65 | 83.04 |
| Henrik Schulz | 2 | 39 | 5.76 |