A Combinatorial Analysis of Boundary Data Structure Schemata

Authors:
Tony Woo
Affiliations:
University of Michigan
Venue:
IEEE Computer Graphics and Applications
Year:
1985

Citing 0
Cited 6

Non-manifold Decomposition in Arbitrary Dimensions

DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Education: Visualizing and animating the winged-edge data structure

Computers and Graphics
Model-based view planning

Machine Vision and Applications
Approximating centroids for the maximum intersection of spherical polygons

Computer-Aided Design
Manifoldization of β-shapes in O(n) time

Computer-Aided Design
Technical note: Linear algebraic representation for topological structures

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Speed up the software in geometric algorithms for solid modeling, CAD/CAM, and robotics applications. How? By using boundary data structures that are fast and use less storage.