Extended octtree representation of free form surfaces (Q580875): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-8396(87)90031-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990973499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of curve and surface methods in CAGD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Component Labeling Using Quadtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for algebraic curve intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise algebraic surface patches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design techniques for the definition of solid objects with free-form geometry / rank
 
Normal rank

Latest revision as of 12:26, 18 June 2024

scientific article
Language Label Description Also known as
English
Extended octtree representation of free form surfaces
scientific article

    Statements

    Extended octtree representation of free form surfaces (English)
    0 references
    0 references
    0 references
    1987
    0 references
    The octtree encoding for the representation of threedimensional surfaces was given by \textit{D. Meagher} [Geometric modelling using octree encoding, Comput. Graphics Image Process. 19, 129-147 (1982)]. The octtree representation is effective for Boolean operations and volume computations, it is ineffective for applying similarity transformations and memory requirements can become very large. The last defect, and connected with it an easier smooth representation of slanted faces, is removed by the authors by adding data to the octtree scheme that allow a unique representation of the surface by biquadratic Bézier-Bernstein patches. They give examples that show that for an increase in memory space of between 10 and 15 percent one obtains a scheme combining the advantages of octtree and Bézier spline representations.
    0 references
    0 references
    0 references
    0 references
    0 references
    geometric modeling
    0 references
    solid-surface operations
    0 references
    octtree encoding
    0 references
    threedimensional surfaces
    0 references
    volume computations
    0 references
    biquadratic Bézier- Bernstein patches
    0 references
    Bézier spline
    0 references
    0 references