Andrzej Szymczak
- 1.B.G.Baumgart, Winged Edge Polyhedron Representation, AIM- 79, Stanford University, Report STAN-CS-320, 1972. Google Scholar
Digital Library
- 2.B.G.Baumgart, A Polyhedron Representation for Computer Vision, AFIPS Nat. Cor~f. Proc., Vol.44, 589-596, 1975.Google Scholar
- 3.M.M.Cohen, A Coursq; in Simple-Homotopy Theory., Springer- Verlag 1970.Google Scholar
- 4.M.Deering, Geometric Compression, Computer Grap,~ics (Proc. SIGGRAPH), p.13.-20, August 1995. Google ScholarDigital Library
- 5.M.Denny and C.Sohler, Encoding a triangulation as a permutation of its point set, Proc. 9th Canadian Conference on Computational Geometry, pp.39-43, Ontario, August 11-14, 1997.Google Scholar
- 6.D.Dobkin and D.Kirkpatrick, A linear algorithm for determining the separation of convex polyhedra, Journal of Algorit}~ms, Vol.6, pp.381-392, 1985.Google Scholar
- 7.L.Floriani and B.Falcidieno, A Hierarchical Boundary' Model for Solid Object Representation, ACM Transactions oll Graphics 7(1), pp.42-60, 198~. Google ScholarDigital Library
- 8.E.Gursoz and F.Prinz, Boolean Set Operators oll Non-Manifold Boundary Representation Objects, Computer-Aided Design 23(1), pp.33-39, Jvamary/February 1991. Google ScholarDigital Library
- 9.E.Gursoz, Y.Choi ~md F.Prinz, Node-Based Representation of Non-Manifold Surf~tce Boundaries in Geometric Modeling, In: J.Turner, M.Wozny and K.Preiss eds., Geometric Modeling for Product Enginee~r~g, North-Holland 1989.Google Scholar
- 10.P.Heckbert and M.G~rland, Survey of Polygonal Surface Simplification Algorithms, in Mul~iresolution Surface Modeling Course, ACM SIGGRAPH Course Notes, 1997.Google Scholar
- 11.H.Hoppe, Progressive Meshes, Computer Graphics (Proc. SIG- GRAPH), p.99-108, August 1996. Google ScholarDigital Library
- 12.H.Hoppe, T.DeRose, T.Ducharnp, J.McDonald and ~V.Stuetzle, Mesh Optimization, Computer Graphics (Proc. S1GGRAPH), p.19-26, August 1993. Google ScholarDigital Library
- 13.Y.E.K-,day, The Hybrid Edge: A Topological Data Structure for Vertically Integrated Geometric Modeling, Computer.-Aided Design 21(3), pp.130-140, 1989. Google ScholarDigital Library
- 14.K.Keeler and J.Westb:rook, Short Encodings of Plav,ar Graphs asad Maps, Discrete Applied Mathematics, No. 58, pp.239-252, 1995. Google ScholarDigital Library
- 15.D.Kirkpatrick, Optimal search in planar subdivisions, SIAM Journal of Computing, vol 12, pp 28-35, 1983.Google ScholarDigital Library
- 16.M.MSntyl~i, An Introduction to Solid Modeling, Computer Science Press, Rockville, Maryland 1988.Google Scholar
- 17.M.Naor, Succinct representation of general unlabeled graphs, Discrete Applied Mathematics, vol. 29, pp. 303-307, North Holland, 1990. Google ScholarDigital Library
- 18.R.Ronfard and J.Rossignac, Full-range approximation of trivalgulated polyhedra, Proc. Eurographics'96, Computer Graphics Forum, pp. C-67, vo1.15, no.3, August 1996.Google Scholar
- 19.J. Rossignac and M. O'Connor, SGC: A Dimension-independent Model for Pointsets with Internal Structures and Incomplete Boundaries, in Geometric Modeling for Product Engineering, Eds. M. Wosny, J. Turner, K. Preiss, North-Holland, pp. 145- 180, 1989.Google Scholar
- 20.J.Rossignac, Through the cracks of the solid modeling milestone, From Object Modeling to Advanced Visual Communication, Eds. S.Coquillart, W.Strasser, P.Stucki, Springer-Verlag, pp. 1- 75, 1994.Google Scholar
- 21.J.Rossignac, Edgebreaker: Compressing the connectivity of triangle meshes, GVU Technical Report GIT-GVU-98-17, Georgia Institute of Technology, http://~mw, cc .gatlch. edu/gvu/ reports/1998.Google Scholar
- 22.J.Snoeyink and M.van Kerveld, Good orders for incremental (re)construction, Proc. ACM Symposium on Computational Geometry, pp.400-402, Nice, France, June 1997. Google ScholarDigital Library
- 23.O. Staadt and M. Gross, Progressive Tetrahedralization, Proc. IEEE Visualization, pp. 39}':402, Research Triangle Park, October 18-23, 1998. Google ScholarDigital Library
- 24.A.Szymczak and J.Rossignac, Grow & Fold: Compression of Tetrahedral Meshes, GVU Technical Report GIT-GVU-98.Google Scholar
- 25.G.Taubin and j.Rossignac, Geometric Compression Through Topological Surgery, ACM Transactions on Graphics, Voi.17, no.2, pp.84-115, April 1998. Google ScholarDigital Library
- 26.G.Taubin, W.Horn, F.Lazaxus and J.Rossignac, Geometry Coding and VRML, Proceedings of the IEEE, pp.1228-1243, vol.96, no.6, June 1998.Google Scholar
- 27.I. Trotts, B. Hamann, K. Joy, D. WHey, Simplification of Tetrahedral Meshes, Proc. IEEE Visualization, pp. 287:295, Research Triangle Park, October 18-23, 1998. Google ScholarDigital Library
- 28.G.Taran, On the Succinct Representation of Graphs, Discrete Applied Mathematics 8, pp.289-294, 1984.Google ScholarCross Ref
- 29.T.C.Woo, A Combinatorial Analysis of Boundary Data Structure, IEEE Computer Graphics and Applications, Vol.5, pp.19- 27, 1985.Google Scholar
Index Terms
- Grow & fold: compression of tetrahedral meshes
Recommendations
Honeycomb and k-fold Hermite subdivision schemes
We construct Hermite subdivision schemes for hexagon tiling and quadrisection /3 refinement, which have applications in free-form surface design. Such subdivision schemes operate in such a way that when a ''jet'' of Hermite data is attached to each of ...
Honeycomb and k-fold Hermite subdivision schemes
We construct Hermite subdivision schemes for hexagon tiling and quadrisection/√3 refinement, which have applications in free-form surface design. Such subdivision schemes operate in such a way that when a "jet" of Hermite data is attached to each of the ...
Mill and fold: Shape simplification for fabrication
Highlights- Simplification of Shapes for Fabrication with sheets of rigid materials.
- ...
Graphical abstractDisplay Omitted
AbstractWe introduce a pipeline for simplifying digital 3D shapes and fabricate them using 2D polygonal flat parts. Our method generates shapes that, once unfolded, can be fabricated with CNC milling machines using special tools called V-...
Comments