toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
  Record Links
Author (up) Zou, H.L.; Lee, Y.T. openurl 
  Title Detecting minimum over-constrained subgraphs in 2D and 3D based on degree of freedom analysis Type Journal Article
  Year 2005 Publication Computer-Aided Design and Applications Abbreviated Journal  
  Volume 2 Issue 1-4 Pages 393-402  
  Keywords Algorithms;Geometry;Rigidity;  
  Abstract We present a flow-based method for finding minimum over constrained subgraphs in a geometric constraint graph. In 2D several different approaches have been implemented, while the 3D problem, in which the entities are points, lines and planes of a model, is much less investigated in the literature. We present a general algorithm for the problem both in 2D and 3D, show that the algorithm is correct and can be used to identify if there is an over constrained subgraph in a constraint graph.  
  Corporate Author Thesis  
  Publisher Place of Publication P. O. Box 48693, Tampa, FL 33647-0123, United States Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 1686-4360 ISBN Medium  
  Area Expedition Conference  
  Notes 3-D problems;Constraint graph;Degree of freedom;Degree of rigidity;Flow-based methods;Geometric constraint;Over constrained subgraph;Over-constrained;Subgraphs; Approved no  
  Call Number refbase @ user @ Zou2005 Serial 11980  
Permanent link to this record
Select All    Deselect All
 |   | 

Save Citations:
Export Records: