GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING (Q3422218): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverings of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sketch-based pruning of a solution space within a formal geometric constraint solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491338 / rank
 
Normal rank

Latest revision as of 13:55, 25 June 2024

scientific article
Language Label Description Also known as
English
GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING
scientific article

    Statements

    GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING (English)
    0 references
    0 references
    0 references
    9 February 2007
    0 references
    0 references
    geometric constraints
    0 references
    computer vision
    0 references
    decomposition algorithm
    0 references
    image information
    0 references