Polygon properties calculated from the vertex neighborhoods

Authors:
W. R. Franklin
Affiliations:
Electrical, Computer, and Systems Engineering Dept., 6026 J.E.C., Rensselaer Polytechnic Institute, Troy, NY, USA
Venue:
SCG '87 Proceedings of the third annual symposium on Computational geometry
Year:
1987

Citing 2
Cited 2

Automated conversion of curvilinear wire-frame models to surface boundary models; a topological approach

SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Primitives for the manipulation of general subdivisions and the computation of Voronoi

ACM Transactions on Graphics (TOG)

An efficient algorithm for finding the CSG representation of a simple polygon

SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
A procedure for computing the symmetric difference of regions defined by polygonal curves

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Calculating properties of polyhedra given only the set of the locations and neighborhoods of the vertices is easy. Possible properties include volume, surface area, and point containment testing. No global topological information at all is explicitly needed (although the complete global topology could be recovered). The neighborhood of the vertex means the directions of the edges and faces on it but not their extents. These vertex-based formulae are dual to the usual formulae that use the faces. They have been implemented and the stability against inconsistent data tested. Alternative data structures and formulae for polyhedron calculation are important since special cases are a function partly of the data structure, and because different methods have different numerical accuracy and error detection properties.