Keywords
OctreeComputer scienceIntersection (aeronautics)Digital geometryDisjoint setsAlgorithmRepresentation (politics)Data structureInteger (computer science)Time complexityTree (set theory)MathematicsDiscrete mathematicsImage processingComputer visionCombinatorics
Affiliated Institutions
Related Publications
GEPOL: An improved description of molecular surfaces II. Computing the molecular area and volume
Abstract The algorithm used by the program GEPOL for a finer description of molecular surface (for a fast calculation of molecular area and volume and for an efficient selection...
Dynamic Graph CNN for Learning on Point Clouds
Point clouds provide a flexible geometric representation suitable for countless applications in computer graphics; they also comprise the raw output of most 3D data acquisition ...
An algorithm for constructing the aspect graph
In this paper we present tight bounds on the maximum size of aspect graphs and give worstcase optimal algorithms for their construction, first in the convex case and then in the...
Hill shading and the reflectance map
Abstract-Shaded overlays for maps give the user an immediate appreciation for the surface topography since they appeal to an important visual depth cue. A brief review of the hi...
An Algorithm for the General Petri Net Reachability Problem
An algorithm is presented for the general Petri net reachability problem. It is based on a generalization of the basic reachability tree construction which is made symmetric wit...
Publication Info
- Year
- 1982
- Type
- article
- Volume
- 19
- Issue
- 2
- Pages
- 129-147
- Citations
- 1220
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1220
OpenAlex
Cite This
Donald J. Meagher
(1982).
Geometric modeling using octree encoding.
Computer Graphics and Image Processing
, 19
(2)
, 129-147.
https://doi.org/10.1016/0146-664x(82)90104-6
Identifiers
- DOI
- 10.1016/0146-664x(82)90104-6