Creating volume models from edge-vertex graphs

@article{Hanrahan1982CreatingVM,
  title={Creating volume models from edge-vertex graphs},
  author={Pat Hanrahan},
  journal={Proceedings of the 9th annual conference on Computer graphics and interactive techniques},
  year={1982}
}
  • P. Hanrahan
  • Published 1 July 1982
  • Computer Science, Mathematics
  • Proceedings of the 9th annual conference on Computer graphics and interactive techniques
The design of complex geometric models has been and will continue to be one of the limiting factors in computer graphics. A careful enumeration of the properties of topologically correct models, so that they may be automatically enforced, can greatly speed this process. An example of the problems inherent in these methods is the “wire frame” problem, the automatic generation of a volume model from an edge-vertex graph. The solution to this problem has many useful applications in geometric… 

Figures from this paper

Solid Model Reconstruction of Wireframe CAD Models Based on Topological Embeddings of Planar Graphs
TLDR
The proposed approach provides a method for easy and intuitive geometric modeling as well as a conversion tool for legacy wireframes by generating the complete set of topological solutions without referring to the geometry of the wireframe, which makes the process free from geometric errors and instabilities.
A shortest path approach to wireframe to solid model conversion
TLDR
The new algorithm is conceptually simpler than previous embedding and other topological algorithms for resolving the faces of wireframes with a unique embedding (genus O, 3 connected only) and holds promise as an efficient cycle generator for input to more generat algorithms.
Graph based topological analysis of tessellated surfaces
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substantial circles or
A general and efficient method for finding cycles in 3D curve networks
TLDR
This work presents a new algorithm for finding cycles that bound surface patches that is unrestricted, generating both manifold and non-manifold geometry with arbitrary genus.
Automated conversion of curvilinear wire-frame models to surface boundary models; a topological approach
An algorithm is presented for automatically converting data representing unambiguous, three-dimensional objects in wire-frame form with curvilinear edges into a boundary representation. The method is
nD Object Representation and Detection from Single 2D Line Drawing
TLDR
The proposed wireframe representation of nD object, which is a single 2D line drawing, outperforms any other algorithm in 2D face identification in that it generally does not generate redundant cycles that are not assigned as faces, and can handle 3D solids of over 10,000 faces.
A FAST ALGORITHM FOR N D POLYHEDRAL SCENE PERCEPTION FROM A SINGLE 2D LINE DRAWING
In this paper, we study the problem of reconstructing the polyhedral structures of a general nD polyhedral scene from its single 2D line drawing. With the idea of local construction and propagation,
Geometric modeling of solid objects by using a face adjacency graph representation
TLDR
A hierarchical graph structure based on the face adjacency graph, which provides a representation of an object at different levels of detail is described, consistent with the stepwise refinement process through which the object description is produced.
...
...

References

SHOWING 1-10 OF 12 REFERENCES
On determining the genus of a graph in O(v O(g)) steps(Preliminary Report)
TLDR
An algorithm which on input a graph G and a positive integer g finds an embedding of G on a surface on genius g, if such an embedbling exists, and which is rewritten Euler's formula.
An Improved Algorithm for Testing the Planarity of a Graph
  • F. Rubin
  • Computer Science
    IEEE Transactions on Computers
  • 1975
TLDR
The present implementation of Hopcroft and Tarjan's algorithm for testing the planarity of a graph is found to run in linear time for most ordinary cases, about twice as fast asTarjan's Algol implementation.
Fleshing Out Wire Frames
TLDR
An algorithm which discovers all objects with a given wire frame is presented, which has a number of applications to mechanical design besides being of mathematical interest, has been implemented and has performed well on complex objects.
Geometric modeling for computer vision.
TLDR
In computer vision geometric models provide a goal for descriptive image analysis, an origin for verification image synthesis, and a context for spatial problem solving.
Generating Semantic Descriptions From Drawings of Scenes With Shadows
This report reproduces a thesis of the same title submitted to the Department of Electrical Engineering, Massachusetts Institute of Technology, in partial fulfillment of the requirements for the
PICAX - Polyhedron Input to the Computer Using an Axonometric Drawing
  • Interactive Techniques in Computer Aided Design
On - Determining the Genus of a Graph in O ( v U [ g ) ) Steps
    Graphes plainaires : reconaissance et constructien de representations planares topologiques
      ...
      ...