6 search results - page 1 / 2 » Lists of Face-Regular Polyhedra |
JCISD
2000
13 years 6 months ago
2000
GISCIENCE
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersectin...
GMP
2000
IEEE
13 years 10 months ago
2000
IEEE
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
COMPGEOM
1991
ACM
13 years 9 months ago
1991
ACM
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
GMP
2003
IEEE
13 years 11 months ago
2003
IEEE
We present a general walk-through point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked li...