Towards shape representation using trihedral mesh projections

Visual Computer

Volumn 19, Issue 2-3, 2003, Pages 139-150

  Ros, Lluís ^a   Sugihara, Kokichi ^b   Thomas, Federico ^a  

^a CSIC   (Spain)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

AND OR graphs; Polygonization; Reconstruction from projections; Shape representation; Trihedral mesh

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTER AIDED LOGIC DESIGN; CONSTRAINT THEORY; IMAGE RECONSTRUCTION; TWO DIMENSIONAL;

POLYGONAL MESH; POLYGONIZATION METHOD; SHAPE REPRESENTATION;

COMPUTER GRAPHICS;

EID: 0038111996     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00371-002-0176-9     Document Type: Article

References (18)

1. Barker CB, Dobkin DP, Huhdanpaa HT (1996) The quick-hull algorithm for convex hulls. ACM Trans Math Softw 22(4):469-483
2. Boor C (1987) Cutting corners always works. Comput Aided Geom Des 4:125-131
3. Chuang JH, Hoffmann CM, Ko KM, Hwang WC (1998) Adaptive polygonization of geometrically constrained surfaces. Vis Comput 14(10):455-470
4. Coxeter HSMcD (1987) Projective Geometry, 2nd edition. Springer, Berlin Heidelberg New York
5. Fox D, Joy KI (1998) On polyhedral approximations to a sphere. Proceedings of the IEEE Computer Graphics International Conference, pp 426-432, IEEE Press
6. Heckbert P, Garland M (1997) Survey of polygonal surface simplification algorithms. In: Multiresolution Surface Modeling Course SIGGRAPH'97, May 1997. Available at http://www.cs.cmu.edu/~ph
7. Hoschek J (1983) Dual Bézier curves and surfaces. In: Barnhill RE, Boehm W (eds.), Surfaces in Computer Aided Geometric Design. North-Holland, Amsterdam, pp 147-156
8. Jiménez P, Torras C (2000) An efficient algorithm for searching implicit AND/OR graphs with cycles. Artif Intell 124:1-30
9. Qhull (2002) Qhull home page at the Geometry Center University of Minnesota. http://www.geo.umn.edu/software/qhull/. Cited 17 July 2002
10. Ros L (2000) A kinematic-geometric approach to spatial interpretation of line drawings. PhD thesis, Polytechnic University of Catalonia. Available at http://www-iri.upc.es/people/ros
11. Ros L, Thomas F (2002) Overcoming superstrictness in line drawing interpretation. IEEE Trans Pattern Anal Mach Intell 24(4):456-466
12. Seibold W, Wyvill G (1998) Towards an understanding of surfaces through polygonization. Proceedings of the IEEE Computer Graphics International Conference, pp 416-425, IEEE Press
13. Sugihara K (1984) An algebraic approach to shape-from-image problems. Artif Intell 23:59-95
14. Sugihara K (1986) Machine interpretation of line drawings. MIT Press, Cambridge, Mass.
15. Sugihara K (1999) Resolvable representation of polyhedra. Discrete Comput Geom 21(2):243-255
16. Whiteley W (1988) Some matroids on hypergraphs with applications to scene analysis and geometry. Discrete Comput Geom 4:75-95
17. Whiteley W (1994) How to design or describe a polyhedron. J Intell Rob Syst 11:135-160
18. Wünsche B, Lobb R (1999) Triage polygonization of rounded polyhedra. Vis Comput 15(1):36-54