@inproceedings{OB:2003:PGS, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {009-019}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/009-019-boissonnat-paper.pdf}, title = {Provably Good Surface Sampling and Approximation}, author = {Steve Oudot and J-D Boissonnat } } @inproceedings{SG:2003:ESR, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {020-030}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/020-030-surazhsky-paper.pdf}, title = {Explicit Surface Remeshing}, author = {Vitaly Surazhsky and Craig Gotsman} } @inproceedings{Boier:2003:DDF, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {031-041}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/031-041-boier-martin-paper.pdf}, title = {Domain Decomposition for Multiresolution Analysis}, author = {Ioana M. Boier-Martin} } @inproceedings{SC:2003:HPQ, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {042-051}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/042-051-sorkine-paper.pdf}, title = {High-Pass Quantization for Mesh Encoding}, author = {Olga Sorkine and Daniel Cohen-Or and Sivan Toledo} } @inproceedings{LC:2003:GCO, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {052-061}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/052-061-lavu-paper.pdf}, title = {Geometry Compression of Normal Meshes Using Rate-Distortion Algorithms}, author = {Sridhar Lavu and Hyeokho Choi and Richard Baraniuk} } @inproceedings{AF:2003:ESR, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {062-071}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/062-071-attene-paper.pdf}, title = {Edge-Sharpener: Recovering Sharp Features in Triangulations of non-adaptively re-meshed surfaces}, author = {Marco Attene and Bianca Facidieno and Michela Spagnuolo and Jarek Rossignac} } @inproceedings{FH:2003:ASD, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {072-082}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/072-082-defloriani.pdf}, title = {A scalable data structure for three-dimensional non-manifold objects}, author = {Leila De Floriani and Annie Hui} } @inproceedings{Gomes:2003:ACB, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {083-093}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/083-093-gomes-paper.pdf}, title = {A Concise B-Rep Data Structure For Stratified Subanalytic Objects}, author = {Abel Gomes} } @inproceedings{OL:2003:CDH, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {094-101}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/094-101-otaduy-paper.pdf}, title = {CLODs: Dual Hierarchies for Multiresolution Collision Detection}, author = {Miguel A. Otaduy and Ming C. Lin} } @inproceedings{KS:2003:SSF, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {102-106}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/102-106-kirsanov-paper.pdf}, title = {Simple Silhouettes for Complex Meshes}, author = {Danil Kirsanov and Pedro V. Sander and Steven J. Gortler} } @inproceedings{KV:2003:SPG, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {107-115}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/107-115-kalaiah-paper.pdf}, title = {Statistical Point Geometry}, author = {Aravind Kalaiah and Amitabh Varshney} } @inproceedings{VK:2003:EMN, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {116-126}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/116-126-varadhan-paper.pdf}, title = {Efficient Max Norm Distance Computation for Reliable Voxelization}, author = {Gokul Varadhan and Shankar Krishnan and Young J. Kim and Dinesh Manocha and Suhas Diggavi} } @inproceedings{Velho:2003:SSG, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {188-199}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/188-199-velho-paper.pdf}, title = {Stellar Subdivision Grammars}, author = {Luiz Velho} } @inproceedings{LH:2003:SGI, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {138-145}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/138-145-losasso-paper.pdf}, title = {Smooth Geometry Images}, author = {Frank Losasso and Hugues Hoppe and Scott Schaefer and Joe Warren} } @inproceedings{SW:2003:MCG, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {146-155}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/146-155-sander-paper.pdf}, title = {Multi-Chart Geometry Images}, author = {Pedro V. Sander and Zoe J. Wood and Steven J. Gortler and John Snyder and Hugues Hoppe } } @inproceedings{KF:2003:RIS, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {156-165}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/156-165-kazhdan-paper.pdf}, title = {Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors }, author = {Michael Kazhdan and Thomas Funkhouser and Szymon Rusinkiewicz} } @inproceedings{WJ:2003:AGD, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {166-176}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/166-176-ju-paper.pdf}, title = {A geometric database for gene expression data}, author = {Joe Warren and Tao Ju and Gregor Eichele and Christina Thaller and Wah Chiu and James Carson } } @inproceedings{CP:2003:EDQ, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {177-187}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/177-187-cazals-paper.pdf}, title = {Estimating Differential Quantities using Polynomial fitting of Osculating Jets}, author = {Frederic Cazals and Marc Pouget} } @inproceedings{GY:2003:GCP, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {127-137}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/127-137-gu-paper.pdf}, title = {Global Conformal Parameterization}, author = {Xianfeng Gu and Shing-Tung Yau} } @inproceedings{Liepa:2003:FHI, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {200-20}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/200-206-liepa-paper.pdf}, title = {Filling Holes in Meshes}, author = {Peter Liepa} } @inproceedings{BK:2003:MFE, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {207-217}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/207-217-bendels-paper.pdf}, title = {Mesh Forging: Editing of 3D-Meshes Using Implicitly Defined Occluders}, author = {G. H. Bendels and R. Klein} } @inproceedings{Chaine:2003:AGB, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {218-229}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/218-229-chaine-paper.pdf}, title = {A geometric-based convection approach of 3-D reconstruction}, author = {Raphaelle Chaine} } @inproceedings{AA:2003:AAI, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {230-239}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/230-239-adamson-paper.pdf}, title = {Approximating and Intersecting Surfaces from Points}, author = {Anders Adamson and Marc Alexa} } @inproceedings{WJ:2003:AIV, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {240-247}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/240-247-wurm-paper.pdf}, title = { Approximate implicitization via curve fitting }, author = {Elmar Wurm and Bert Juettler} } @inproceedings{ZM:2003:3DR, booktitle = {Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing}, year = {2003}, crossref = {SGP03}, isbn = {3-905673-06-1}, pages = {248-259}, location = {Aachen, Germany}, publisher = {Eurographics Association}, URL = {http://www.eg.org/EG/DL/WS/SGP03/248-259-ziegler-paper.pdf}, title = {3D Reconstruction Using Labeled Image Regions}, author = {Remo Ziegler and Wojciech Matusik and Hanspeter Pfister and Leonard McMillan} } @proceedings{SGP03, editor = {Leif Kobbelt and Peter Schr{\"o}der and Hugues Hoppe}, title = {{P}roceedings of the {E}urographics/{ACM} {SIGGRAPH} symposium on {G}eometry processing}, year = {2003}, isbn = {3-905673-06-1}, issn = {1727-8384}, address = {Aachen, Germany}, publisher = {Eurographics Association}, } %************************2004*********************** @inproceedings{SGP04:011-022:2004, crossref = {SGP04-proc}, author = {Ravikrishna Kolluri and Jonathan Richard Shewchuk and James F. O'Brien}, title = {{Spectral Surface Reconstruction From Noisy Point Clouds}}, pages = {11--22}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/011-022.pdf}, } @inproceedings{SGP04:023-032:2004, crossref = {SGP04-proc}, author = {Niloy J. Mitra and Natasha Gelfand Helmut Pottmann and Leonidas Guibas}, title = {{Registration of Point Cloud Data from a Geometric Optimization Perspective}}, pages = {23--32}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/023-032.pdf}, } @inproceedings{SGP04:033-042:2004, crossref = {SGP04-proc}, author = {Facundo Mémoli and Guillermo Sapiro}, title = {{Comparing Point Clouds}}, pages = {33--42}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/033-042.pdf}, } @inproceedings{SGP04:043-046:2004, crossref = {SGP04-proc}, author = {Pravin Bhat and Stephen Ingram and Greg Turk}, title = {{Geometric Texture Synthesis by Example}}, pages = {43--46}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/043-046.pdf}, } @inproceedings{SGP04:047-056:2004, crossref = {SGP04-proc}, author = {Kun Zhou and John Synder and Baining Guo and Heung-Yeung Shum }, title = {{Iso-charts: Stretch-driven Mesh Parameterization using Spectral Analysis}}, pages = {47--56}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/047-056.pdf}, } @inproceedings{SGP04:057-066:2004, crossref = {SGP04-proc}, author = {Geetika Tewari and John Snyder and Pedro V. Sander and Steven J. Gortler and Hugues Hoppe}, title = {{Signal-Specialized Parameterization for Piecewise Linear Reconstruction}}, pages = {57--66}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/057-066.pdf}, } @inproceedings{SGP04:067-076:2004, crossref = {SGP04-proc}, author = {Budirijanto Purnomo and Jonathan D. Cohen and Subodh Kumar}, title = {{Seamless Texture Atlases}}, pages = {67--76}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/067-076.pdf}, } @inproceedings{SGP04:077-084:2004, crossref = {SGP04-proc}, author = {Minsu Ahn and Seungyong Lee and Hans-Peter Seidel}, title = {{Connectivity Transformation for Mesh Metamorphosis}}, pages = {77--84}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/077-084.pdf}, } @inproceedings{SGP04:085-094:2004, crossref = {SGP04-proc}, author = {Leila De Floriani and David Greenfieldboyce and Annie Hui}, title = {{A data structure for non-manifold simplicial d-complexes}}, pages = {85--94}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/085-094.pdf}, } @inproceedings{SGP04:095-104:2004, crossref = {SGP04-proc}, author = {B. Cutler and J. Dorsey and L. McMillan}, title = {{Simplification and Improvement of Tetrahedral Models for Simulation}}, pages = {95--104}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/095-104.pdf}, } @inproceedings{SGP04:105-116:2004, crossref = {SGP04-proc}, author = {S. Schaefer and J. Warren and D. Zorin}, title = {{Lofting Curve Networks using Subdivision Surfaces}}, pages = {105--116}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/105-116.pdf}, } @inproceedings{SGP04:117-126:2004, crossref = {SGP04-proc}, author = {Michael Kazhdan and Thomas Funkhouser and Szymon Rusinkiewicz}, title = {{Symmetry Descriptors and 3D Shape Matching}}, pages = {117--126}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/117-126.pdf}, } @inproceedings{SGP04:127-138:2004, crossref = {SGP04-proc}, author = {Gunnar Carlssony and Afra Zomorodian and Anne Collins and Leonidas Guibas}, title = {{Persistence Barcodes for Shapes}}, pages = {127--138}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/127-138.pdf}, } @inproceedings{SGP04:139-150:2004, crossref = {SGP04-proc}, author = {Sung-Eui Yoon and Brian Salomon and Ming Lin and Dinesh Manocha}, title = {{Fast Collision Detection between Massive Models using Dynamic Simplification}}, pages = {139--150}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/139-150.pdf}, } @inproceedings{SGP04:151-158:2004, crossref = {SGP04-proc}, author = {S. Schaefer and J. Hakenberg and J. Warren}, title = {{Smooth Subdivision of Tetrahedral Meshes}}, pages = {151--158}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/151-158.pdf}, } @inproceedings{SGP04:159-168:2004, crossref = {SGP04-proc}, author = {Ioana Boier-Martin and Denis Zorin}, title = {{Differentiable Parameterization of Catmull-Clark Subdivision Surfaces}}, pages = {159--168}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/159-168.pdf}, } @inproceedings{SGP04:169-178:2004, crossref = {SGP04-proc}, author = {Charles Loop}, title = {{Second Order Smoothness over Extraordinary Vertices}}, pages = {169--178}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/169-178.pdf}, } @inproceedings{SGP04:179-188:2004, crossref = {SGP04-proc}, author = {O. Sorkine and D. Cohen-Or and Y. Lipman and M. Alexa and C. Rössl and H.-P. Seidel}, title = {{Laplacian Surface Editing}}, pages = {179--188}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/179-188.pdf}, } @inproceedings{SGP04:189-196:2004, crossref = {SGP04-proc}, author = {Mario Botsch and Leif Kobbelt}, title = {{A Remeshing Approach to Multiresolution Modeling}}, pages = {189--196}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/189-196.pdf}, } @inproceedings{SGP04:197-208:2004, crossref = {SGP04-proc}, author = {Ioana Boier-Martin and Holly Rushmeier and Jingyi Jin}, title = {{Parameterization of Triangle Meshes over Quadrilateral Domains}}, pages = {197--208}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/197-208.pdf}, } @inproceedings{SGP04:209-218:2004, crossref = {SGP04-proc}, author = {Steve Zelinka and Michael Garland}, title = {{Similarity-Based Surface Modelling Using Geodesic Fans}}, pages = {209--218}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/209-218.pdf}, } @inproceedings{SGP04:219-228:2004, crossref = {SGP04-proc}, author = {Natasha Gelfand Leonidas J. Guibas}, title = {{Shape Segmentation Using Local Slippage Analysis}}, pages = {219--228}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/219-228.pdf}, } @inproceedings{SGP04:229-240:2004, crossref = {SGP04-proc}, author = {Nathan A. Carr and John C. Hart}, title = {{Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces}}, pages = {229--240}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/229-240.pdf}, } @inproceedings{SGP04:241-250:2004, crossref = {SGP04-proc}, author = {Gokul Varadhan and Shankar Krishnan and TVN Sriram and Dinesh Manocha}, title = {{Topology Preserving Surface Extraction Using Adaptive Subdivision}}, pages = {241--250}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/241-250.pdf}, } @inproceedings{SGP04:251-260:2004, crossref = {SGP04-proc}, author = {Simon Plantinga and Gert Vegter}, title = {{Isotopic Approximation of Implicit Curves and Surfaces}}, pages = {251--260}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP04/251-260.pdf}, } @proceedings{SGP04-proc, editor = {Roberto Scopigno and Denis Zorin}, title = {{Eurographics Symposium on Geometry Processing}}, year = {2004}, isbn = {3-905673-13-4}, issn = {1727-8384}, address = {Nice, France}, publisher = {Eurographics Association}, } %************************2005*********************** @inproceedings{SGP05:009-011:2005, crossref = {SGP05-proc}, author = {Herbert Edelsbrunner}, title = {{Surface Tiling with Differential Topology}}, pages = {9--11}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/009-011.pdf}, DOI = {10.2312/SGP/SGP05/009-011} } @inproceedings{SGP05:013-022:2005, crossref = {SGP05-proc}, author = {Vladislav Kraevoy and Alla Sheffer}, title = {{Template-Based Mesh Completion}}, pages = {13--22}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/013-022.pdf}, DOI = {10.2312/SGP/SGP05/013-022} } @inproceedings{SGP05:023-032:2005, crossref = {SGP05-proc}, author = {Mark Pauly and Niloy J. Mitra and Joachim Giesen and Markus Gross and Leonidas J. Guibas}, title = {{Example-Based 3D Scan Completion}}, pages = {23--32}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/023-032.pdf}, DOI = {10.2312/SGP/SGP05/023-032} } @inproceedings{SGP05:033-041:2005, crossref = {SGP05-proc}, author = {Joshua Podolak and Szymon Rusinkiewicz}, title = {{Atomic Volumes for Mesh Completion}}, pages = {33--41}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/033-041.pdf}, DOI = {10.2312/SGP/SGP05/033-041} } @inproceedings{SGP05:043-052:2005, crossref = {SGP05-proc}, author = {Tamal K. Dey and Jian Sun}, title = {{An Adaptive MLS Surface for Reconstruction with Guarantees}}, pages = {43--52}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/043-052.pdf}, DOI = {10.2312/SGP/SGP05/043-052} } @inproceedings{SGP05:053-062:2005, crossref = {SGP05-proc}, author = {Boris Mederos and Nina Amenta and Luiz Velho and Luiz Henrique de Figueiredo}, title = {{Surface Reconstruction for Noisy Point Clouds}}, pages = {53--62}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/053-062.pdf}, DOI = {10.2312/SGP/SGP05/053-062} } @inproceedings{SGP05:063-072:2005, crossref = {SGP05-proc}, author = {Carlos E. Scheidegger and Shachar Fleishman and Claudio T. Silva}, title = {{Triangulating Point Set Surfaces with Bounded Error}}, pages = {63--72}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/063-072.pdf}, DOI = {10.2312/SGP/SGP05/063-072} } @inproceedings{SGP05:073-082:2005, crossref = {SGP05-proc}, author = {Michael Kazhdan}, title = {{Reconstruction of Solid Models from Oriented Point Sets}}, pages = {73--82}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/073-082.pdf}, DOI = {10.2312/SGP/SGP05/073-082} } @inproceedings{SGP05:083-084:2005, crossref = {SGP05-proc}, author = {Marc Alexa}, title = {{Non-conforming Surface Rrepresentations}}, pages = {83--84}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/083-084.pdf}, DOI = {10.2312/SGP/SGP05/083-084} } @inproceedings{SGP05:085-090:2005, crossref = {SGP05-proc}, author = {Klaus Hildebandt and Konrad Polthier and Max Wardetzky}, title = {{Smooth Feature Lines on Surface Meshes}}, pages = {85--90}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/085-090.pdf}, DOI = {10.2312/SGP/SGP05/085-090} } @inproceedings{SGP05:091-100:2005, crossref = {SGP05-proc}, author = {Rhaleb Zayer and Christian Rössl and Hans-Peter Seidel}, title = {{Setting the Boundary Free: A Composite Approach to Surface Parameterization}}, pages = {91--100}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/091-100.pdf}, DOI = {10.2312/SGP/SGP05/091-100} } @inproceedings{SGP05:101-110:2005, crossref = {SGP05-proc}, author = {Alexander I. Bobenko and Peter Schröder}, title = {{Discrete Willmore Flow}}, pages = {101--110}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/101-110.pdf}, DOI = {10.2312/SGP/SGP05/101-110} } @inproceedings{SGP05:111-118:2005, crossref = {SGP05-proc}, author = {Martin Isenburg and Peter Lindstrom and Jack Snoeyink}, title = {{Streaming Compression of Triangle Meshes}}, pages = {111--118}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/111-118.pdf}, DOI = {10.2312/SGP/SGP05/111-118} } @inproceedings{SGP05:119-128:2005, crossref = {SGP05-proc}, author = {Leila De Floriani and Annie Hui}, title = {{Data Structures for Simplicial Complexes: An Analysis And A Comparison}}, pages = {119--128}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/119-128.pdf}, DOI = {10.2312/SGP/SGP05/119-128} } @inproceedings{SGP05:129-138:2005, crossref = {SGP05-proc}, author = {Pedro V. Sander and Jason L. Mitchell}, title = {{Progressive Buffers: View-dependent Geometry and Texture for LOD Rendering}}, pages = {129--138}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/129-138.pdf}, DOI = {10.2312/SGP/SGP05/129-138} } @inproceedings{SGP05:139-148:2005, crossref = {SGP05-proc}, author = {Dominique Attali and David Cohen-Steiner and Herbert Edelsbrunner}, title = {{Extraction and Simplification of Iso-surfaces in Tandem}}, pages = {139--148}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/139-148.pdf}, DOI = {10.2312/SGP/SGP05/139-148} } @inproceedings{SGP05:149-158:2005, crossref = {SGP05-proc}, author = {Yutaka Ohtake and Alexander Belyaev and Marc Alexa}, title = {{Sparse Low-degree Implicits with Applications to High Quality Rendering, Feature Extraction, and Smoothing}}, pages = {149--158}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/149-158.pdf}, DOI = {10.2312/SGP/SGP05/149-158} } @inproceedings{SGP05:159-160:2005, crossref = {SGP05-proc}, author = {Luiz Velho}, title = {{Modeling with Simplicial Diffeomorphisms}}, pages = {159--160}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/159-160.pdf}, DOI = {10.2312/SGP/SGP05/159-160} } @inproceedings{SGP05:161-170:2005, crossref = {SGP05-proc}, author = {Johannes Wallner and Qinmin Yang}, title = {{Swept Volumes of many Poses}}, pages = {161--170}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/161-170.pdf}, DOI = {10.2312/SGP/SGP05/161-170} } @inproceedings{SGP05:171-180:2005, crossref = {SGP05-proc}, author = {Scott Schaefer and David Levin and Ron Goldman}, title = {{Subdivision Schemes and Attractors}}, pages = {171--180}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/171-180.pdf}, DOI = {10.2312/SGP/SGP05/171-180} } @inproceedings{SGP05:181-186:2005, crossref = {SGP05-proc}, author = {Tao Ju and Scott Schaefer and Joe Warren and Mathieu Desbrun}, title = {{A Geometric Construction of Coordinates for Convex Polyhedra using Polar Duals}}, pages = {181--186}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/181-186.pdf}, DOI = {10.2312/SGP/SGP05/181-186} } @inproceedings{SGP05:187-196:2005, crossref = {SGP05-proc}, author = {Shankar Krishnan and Pei Yean Lee and John B. Moore and Suresh Venkatasubramanian}, title = {{Global Registration of Multiple 3D Point Sets via Optimization-on-a-Manifold}}, pages = {187--196}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/187-196.pdf}, DOI = {10.2312/SGP/SGP05/187-196} } @inproceedings{SGP05:197-206:2005, crossref = {SGP05-proc}, author = {Natasha Gelfand Niloy J. Mitra and Leonidas J. Guibas and Helmut Pottmann}, title = {{Robust Global Registration}}, pages = {197--206}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/197-206.pdf}, DOI = {10.2312/SGP/SGP05/197-206} } @inproceedings{SGP05:207-216:2005, crossref = {SGP05-proc}, author = {Nathan Litke and Marc Droske and Martin Rumpf and Peter Schröder}, title = {{An Image Processing Approach to Surface Matching}}, pages = {207--216}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/207-216.pdf}, DOI = {10.2312/SGP/SGP05/207-216} } @inproceedings{SGP05:217-226:2005, crossref = {SGP05-proc}, author = {Xinju Li and Igor Guskov}, title = {{Multiscale Features for Approximate Alignment of Point-based Surfaces}}, pages = {217--226}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP05/217-226.pdf}, DOI = {10.2312/SGP/SGP05/217-226} } @proceedings{SGP05-proc, editor = {Mathieu Desbrun and Helmut Pottmann}, title = {{EG Symposium on Geometry Processing}}, year = {2005}, isbn = {3-905673-24-X}, issn = {1727-8384}, address = {Vienna, Austria}, publisher = {Eurographics Association}} %************************2006*********************** @inproceedings{SGP06:011-020:2006, crossref = {SGP06-proc}, author = {Mario Botsch and Mark Pauly and Markus Gross and Leif Kobbelt}, title = {{PriMo: Coupled Prisms for Intuitive Surface Modeling}}, pages = {11--20}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06011-020.pdf}, DOI = {10.2312/SGP/SGP06/011-020} } @inproceedings{SGP06:021-030:2006, crossref = {SGP06-proc}, author = {Takashi Kanai and Yutaka Ohtake and Kiwamu Kase}, title = {{Hierarchical Error-Driven Approximation of Implicit Surfaces from Polygonal Meshes}}, pages = {21--30}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06021-030.pdf}, DOI = {10.2312/SGP/SGP06/021-030} } @inproceedings{SGP06:031-040:2006, crossref = {SGP06-proc}, author = {Denis Zorin}, title = {{Constructing Curvature-continuous Surfaces by Blending}}, pages = {31--40}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06031-040.pdf}, DOI = {10.2312/SGP/SGP06/031-040} } @inproceedings{SGP06:041-050:2006, crossref = {SGP06-proc}, author = {Alexander Hornung and Leif Kobbelt}, title = {{Robust Reconstruction of Watertight 3D Models from Non-uniformly Sampled Point Clouds Without Normal Information}}, pages = {41--50}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06041-050.pdf}, DOI = {10.2312/SGP/SGP06/041-050} } @inproceedings{SGP06:051-060:2006, crossref = {SGP06-proc}, author = {M. Samozino and M. Alexa and P. Alliez and M. Yvinec}, title = {{Reconstruction with Voronoi Centered Radial Basis Functions}}, pages = {51--60}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06051-060.pdf}, DOI = {10.2312/SGP/SGP06/051-060} } @inproceedings{SGP06:061-070:2006, crossref = {SGP06-proc}, author = {Michael Kazhdan and Matthew Bolitho and Hugues Hoppe}, title = {{Poisson Surface Reconstruction}}, pages = {61--70}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06061-070.pdf}, DOI = {10.2312/SGP/SGP06/061-070} } @inproceedings{SGP06:071-080:2006, crossref = {SGP06-proc}, author = {Yaron Lipman and Daniel Cohen-Or and David Levin}, title = {{Error Bounds and Optimal Neighborhoods for MLS Approximation}}, pages = {71--80}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06071-080.pdf}, DOI = {10.2312/SGP/SGP06/071-080} } @inproceedings{SGP06:081-088:2006, crossref = {SGP06-proc}, author = {Torsten Langer and Alexander Belyaev and Hans-Peter Seidel}, title = {{Spherical Barycentric Coordinates}}, pages = {81--88}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06081-088.pdf}, DOI = {10.2312/SGP/SGP06/081-088} } @inproceedings{SGP06:089-099:2006, crossref = {SGP06-proc}, author = {Alexander Belyaev}, title = {{On Transfinite Barycentric Coordinates}}, pages = {89--99}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06089-099.pdf}, DOI = {10.2312/SGP/SGP06/089-099} } @inproceedings{SGP06:101-110:2006, crossref = {SGP06-proc}, author = {Annie Hui and Lucas Vaczlavik and Leila De Floriani}, title = {{A Decomposition-based Representation for 3D Simplicial Complexes}}, pages = {101--110}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06101-110.pdf}, DOI = {10.2312/SGP/SGP06/101-110} } @inproceedings{SGP06:111-119:2006, crossref = {SGP06-proc}, author = {Patricio Simari and Evangelos Kalogerakis and Karan Singh}, title = {{Folding Meshes: Hierarchical Mesh Segmentation based on Planar Symmetry}}, pages = {111--119}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06111-119.pdf}, DOI = {10.2312/SGP/SGP06/111-119} } @inproceedings{SGP06:121-130:2006, crossref = {SGP06-proc}, author = {Niloy J. Mitra and Leonidas Guibas and Joachim Giesen and Mark Pauly}, title = {{Probabilistic Fingerprints for Shapes}}, pages = {121--130}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06121-130.pdf}, DOI = {10.2312/SGP/SGP06/121-130} } @inproceedings{SGP06:131-142:2006, crossref = {SGP06-proc}, author = {T. Funkhouser and P. Shilane}, title = {{Partial Matching of 3D Shapes with Priority-Driven Search}}, pages = {131--142}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06131-142.pdf}, DOI = {10.2312/SGP/SGP06/131-142} } @inproceedings{SGP06:143-152:2006, crossref = {SGP06-proc}, author = {Tamal K. Dey and Jian Sun}, title = {{Defining and Computing Curve-skeletons with Medial Geodesic Function}}, pages = {143--152}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06143-152.pdf}, DOI = {10.2312/SGP/SGP06/143-152} } @inproceedings{SGP06:153-162:2006, crossref = {SGP06-proc}, author = {Enrico Puppo}, title = {{Selectively Refinable Subdivision Meshes}}, pages = {153--162}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06153-162.pdf}, DOI = {10.2312/SGP/SGP06/153-162} } @inproceedings{SGP06:163-171:2006, crossref = {SGP06-proc}, author = {I. Ginkel and G. Umlauf}, title = {{Loop Subdivision with Curvature Control}}, pages = {163--171}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06163-171.pdf}, DOI = {10.2312/SGP/SGP06/163-171} } @inproceedings{SGP06:173-180:2006, crossref = {SGP06-proc}, author = {K. Karciauskas and A. Myles and J. Peters}, title = {{A C2 Polar Jet Subdivision}}, pages = {173--180}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06173-180.pdf}, DOI = {10.2312/SGP/SGP06/173-180} } @inproceedings{SGP06:181-190:2006, crossref = {SGP06-proc}, author = {Nathan A. Carr and Jared Hoberock and Keenan Crane and John C. Hart}, title = {{Rectangular Multi-Chart Geometry Images}}, pages = {181--190}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06181-190.pdf}, DOI = {10.2312/SGP/SGP06/181-190} } @inproceedings{SGP06:191-200:2006, crossref = {SGP06-proc}, author = {Wan-Chiu Li and Nicolas Ray and Bruno Lévy}, title = {{Automatic and Interactive Mesh to T-Spline Conversion}}, pages = {191--200}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06191-200.pdf}, DOI = {10.2312/SGP/SGP06/191-200} } @inproceedings{SGP06:201-210:2006, crossref = {SGP06-proc}, author = {Y. Tong and P. Alliez and D. Cohen-Steiner and M. Desbrun}, title = {{Designing Quadrangulations with Discrete Harmonic Forms}}, pages = {201--210}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06201-210.pdf}, DOI = {10.2312/SGP/SGP06/201-210} } @inproceedings{SGP06:211-221:2006, crossref = {SGP06-proc}, author = {Gokul Varadhan and Shankar Krishnan and Liangjun Zhang and Dinesh Manocha}, title = {{Reliable Implicit Surface Polygonization using Visibility Mapping}}, pages = {211--221}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06211-221.pdf}, DOI = {10.2312/SGP/SGP06/211-221} } @inproceedings{SGP06:223-226:2006, crossref = {SGP06-proc}, author = {Yong-Liang Yang and Yu-Kun Lai and Shi-Min Hu and Helmut Pottmann}, title = {{Robust Principal Curvatures on Multiple Scales}}, pages = {223--226}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06223-226.pdf}, DOI = {10.2312/SGP/SGP06/223-226} } @inproceedings{SGP06:227-230:2006, crossref = {SGP06-proc}, author = {Miklos Bergou and Max Wardetzky and David Harmon and Denis Zorin and Eitan Grinspun}, title = {{A Quadratic Bending Model for Inextensible Surfaces}}, pages = {227--230}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06227-230.pdf}, DOI = {10.2312/SGP/SGP06/227-230} } @inproceedings{SGP06:231-234:2006, crossref = {SGP06-proc}, author = {Yunjin Lee and Seungyong Lee and Ioannis Ivrissimtzis and Hans-Peter Seidel}, title = {{Overfitting Control for Surface Reconstruction}}, pages = {231--234}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06231-234.pdf}, DOI = {10.2312/SGP/SGP06/231-234} } @inproceedings{SGP06:235-238:2006, crossref = {SGP06-proc}, author = {J. Y. S. Li and H. Zhang}, title = {{Nonobtuse Remeshing and Mesh Decimation}}, pages = {235--238}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06235-238.pdf}, DOI = {10.2312/SGP/SGP06/235-238} } @inproceedings{SGP06:239-242:2006, crossref = {SGP06-proc}, author = {S. Biasotti and D. Giorgi and M. Spagnuolo and B. Falcidieno}, title = {{Size Functions for 3D Shape Retrieval}}, pages = {239--242}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP06239-242.pdf}, DOI = {10.2312/SGP/SGP06/239-242} } @proceedings{SGP06-proc, editor = {Alla Sheffer and Konrad Polthier}, title = {Eurographics Symposium on Geometry Processing}, year = {2006}, isbn = {3-905673-36-3}, issn = {1727-8384}, address = {Cagliari, Sardinia, Italy}, publisher = {Eurographics Association} } %------------------------------------2007--------------------- @inproceedings{SGP07:13-22:2007, crossref = {SGP07-proc}, author = {Evangelos Kalogerakis and Patricio Simari and Derek Nowrouzezahrai and Karan Singh}, title = {{Robust Statistical Estimation of Curvature on Discretized Surfaces}}, pages = {13-22}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/013-022.pdf}, DOI = {10.2312/SGP/SGP07/013-022}, abstract = {A robust statistics approach to curvature estimation on discretely sampled surfaces, namely polygon meshes and point clouds, is presented. The method exhibits accuracy, stability and consistency even for noisy, non-uniformly sampled surfaces with irregular configurations. Within an M-estimation framework, the algorithm is able to reject noise and structured outliers by sampling normal variations in an adaptively reweighted neighborhood around each point. The algorithm can be used to reliably derive higher order differential attributes and even correct noisy surface normals while preserving the fine features of the normal and curvature field. The approach is compared with state-of-the-art curvature estimation methods and shown to improve accuracy by up to an order of magnitude across ground truth test surfaces under varying tessellation densities and types as well as increasing degrees of noise. Finally, the benefits of a robust statistical estimation of curvature are illustrated by applying it to the popular applications of mesh segmentation and suggestive contour rendering.} } @inproceedings{SGP07:23-32:2007, crossref = {SGP07-proc}, author = {Jingyi Yu and Xiaotian Yin and Xianfeng Gu and Leonard McMillan and Steven Gortler}, title = {{Focal Surfaces of Discrete Geometry}}, pages = {23-32}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/023-032.pdf}, DOI = {10.2312/SGP/SGP07/023-032}, abstract = {The differential geometry of smooth three-dimensional surfaces can be interpreted from one of two perspectives: in terms of oriented frames located on the surface, or in terms of a pair of associated focal surfaces. These focal surfaces are swept by the loci of the principal curvatures? radii. In this article, we develop a focal-surfacebased differential geometry interpretation for discrete mesh surfaces. Focal surfaces have many useful properties. For instance, the normal of each focal surface indicates a principal direction of the corresponding point on the original surface. We provide algorithms to robustly approximate the focal surfaces of a triangle mesh with known or estimated normals. Our approach locally parameterizes the surface normals about a point by their intersections with a pair of parallel planes.We show neighboring normal triplets are constrained to pass simultaneously through two slits, which are parallel to the specified parametrization planes and rule the focal surfaces. We develop both CPU and GPU-based algorithms to efficiently approximate these two slits and, hence, the focal meshes. Our focal mesh estimation also provides a novel discrete shape operator that simultaneously estimates the principal curvatures and principal directions.} } @inproceedings{SGP07:33-37:2007, crossref = {SGP07-proc}, author = {Max Wardetzky and Saurabh Mathur and Felix Kaelberer and Eitan Grinspun}, title = {{Discrete Laplace operators: No free lunch }}, pages = {33-37}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/033-037.pdf}, DOI = {10.2312/SGP/SGP07/033-037}, abstract = {Discrete Laplace operators are ubiquitous in applications spanning geometric modeling to simulation. For robustness and efficiency, many applications require discrete operators that retain key structural properties inherent to the continuous setting. Building on the smooth setting, we present a set of natural properties for discrete Laplace operators for triangular surface meshes. We prove an important theoretical limitation: discrete Laplacians cannot satisfy all natural properties; retroactively, this explains the diversity of existing discrete Laplace operators. Finally, we present a family of operators that includes and extends well-known and widely-used operators.} } @inproceedings{SGP07:39-48:2007, crossref = {SGP07-proc}, author = {Pierre Alliez and David Cohen-Steiner and Yiying Tong and Mathieu Desbrun}, title = {{Voronoi-based Variational Reconstruction of Unoriented Point Sets }}, pages = {39-48}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/039-048.pdf}, DOI = {10.2312/SGP/SGP07/039-048}, abstract = {We introduce an algorithm for reconstructing watertight surfaces from unoriented point sets. Using the Voronoi diagram of the input point set, we deduce a tensor field whose principal axes and eccentricities locally represent respectively the most likely direction of the normal to the surface, and the confidence in this direction estimation. An implicit function is then computed by solving a generalized eigenvalue problem such that its gradient is most aligned with the principal axes of the tensor field, providing a best-fitting isosurface reconstruction. Our approach possesses a number of distinguishing features. In particular, the implicit function optimization provides resilience to noise, adjustable fitting to the data, and controllable smoothness of the reconstructed surface. Finally, the use of simplicial meshes (possibly restricted to a thin crust around the input data) and (an)isotropic Laplace operators renders the numerical treatment simple and robust.} } @inproceedings{SGP07:49-58:2007, crossref = {SGP07-proc}, author = {Michael Wand and Philipp Jenke and Qixing Huang and Martin Bokeloh and Leonidas Guibas and Andreas Schilling}, title = {{Reconstruction of Deforming Geometry from Time-Varying Point Clouds}}, pages = {49-58}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/049-058.pdf}, DOI = {10.2312/SGP/SGP07/049-058}, abstract = {In this paper, we describe a system for the reconstruction of deforming geometry from a time sequence of unstructured, noisy point clouds, as produced by recent real-time range scanning devices. Our technique reconstructs both the geometry and dense correspondences over time. Using the correspondences, holes due to occlusion are filled in from other frames. Our reconstruction technique is based on a statistical framework: The reconstruction should both match the measured data points and maximize prior probability densities that prefer smoothness, rigid deformation and smooth movements over time. The optimization procedure consists of an inner loop that optimizes the 4D shape using continuous numerical optimization and an outer loop that infers the discrete 4D topology of the data set using an iterative model assembly algorithm. We apply the technique to a variety of data sets, demonstrating that the new approach is capable of robustly retrieving animated models with correspondences from data sets suffering from significant noise, outliers and acquisition holes.} } @inproceedings{SGP07:59-67:2007, crossref = {SGP07-proc}, author = {Yaron Lipman and Daniel Cohen-Or and David Levin}, title = {{Data-Dependent MLS for Faithful Surface Approximation}}, pages = {59-67}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/059-067.pdf}, DOI = {10.2312/SGP/SGP07/059-067}, abstract = {In this paper we present a high-fidelity surface approximation technique that aims at a faithful reconstruction of piecewise-smooth surfaces from a scattered point set. The presented method builds on the Moving Least-Squares (MLS) projection methodology, but introduces a fundamental modification: While the classical MLS uses a fixed approximation space, i.e., polynomials of a certain degree, the new method is data-dependent. For each projected point, it finds a proper local approximation space of piecewise polynomials (splines). The locally constructed spline encapsulates the local singularities which may exist in the data. The optional singularity for this local approximation space is modeled via a Singularity Indicator Field (SIF) which is computed over the input data points. We demonstrate the effectiveness of the method by reconstructing surfaces from real scanned 3D data, while being faithful to their most delicate features.} } @inproceedings{SGP07:69-78:2007, crossref = {SGP07-proc}, author = {Matthew Bolitho and Michael Kazhdan and Randal Burns and Hugues Hoppe}, title = {{Multilevel Streaming for Out-of-Core Surface Reconstruction }}, pages = {69-78}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/069-078.pdf}, DOI = {10.2312/SGP/SGP07/069-078}, abstract = {Reconstruction of surfaces from huge collections of scanned points often requires out-of-core techniques, and most such techniques involve local computations that are not resilient to data errors. We show that a Poisson-based reconstruction scheme, which considers all points in a global analysis, can be performed efficiently in limited memory using a streaming framework. Specifically, we introduce a multilevel streaming representation, which enables efficient traversal of a sparse octree by concurrently advancing through multiple streams, one per octree level. Remarkably, for our reconstruction application, a sufficiently accurate solution to the global linear system is obtained using a single iteration of cascadic multigrid, which can be evaluated within a single multi-stream pass. We demonstrate scalable performance on several large datasets.} } @inproceedings{SGP07:79-88:2007, crossref = {SGP07-proc}, author = {Remi Allegre and Raphaelle Chaine and Samir Akkouche}, title = {{A Streaming Algorithm for Surface Reconstruction}}, pages = {79-88}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/079-088.pdf}, DOI = {10.2312/SGP/SGP07/079-088}, abstract = {We present a streaming algorithm for reconstructing closed surfaces from large non-uniform point sets based on a geometric convection technique. Assuming that the sample points are organized into slices stacked along one coordinate axis, a triangle mesh can be efficiently reconstructed in a streamable layout with a controlled memory footprint. Our algorithm associates a streaming 3D Delaunay triangulation data-structure with a multilayer version of the geometric convection algorithm. Our method can process millions of sample points at the rate of 50k points per minute with 350 MB of main memory.} } @inproceedings{SGP07:89-98:2007, crossref = {SGP07-proc}, author = {Jean-Daniel Boissonnat and Pooran Memari}, title = {{Shape Reconstruction from Unorganized Cross-sections }}, pages = {89-98}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/089-098.pdf}, DOI = {10.2312/SGP/SGP07/089-098}, abstract = {In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications where cross-sections of human organs are obtained by means of a free hand ultrasound apparatus. The position and orientation of the cutting planes may be freely chosen which makes the problem substantially more difficult than in the case of parallel cross-sections, for which a rich literature exists. The input data consist of the cutting planes and (an approximation of) their intersection with the object. Our approach consists of two main steps. First, we compute the arrangement of the cutting planes. Then, in each cell of the arrangement, we reconstruct an approximation of the object from its intersection with the boundary of the cell. Lastly, we glue the various pieces together. The method makes use of the Delaunay triangulation and generalizes the reconstruction method of Boissonnat and Geiger [BG93] for the case of parallel planes. The analysis provides a neat characterization of the topological properties of the result and, in particular, shows an interesting application of Moebius diagrams to compute the locus of the branching points. We have implemented our algorithm in C++, using the [CGAL] library. Experimental results show that the algorithm performs well and can handle complicated branching configurations.} } @inproceedings{SGP07:99-108:2007, crossref = {SGP07-proc}, author = {Wolfram von Funck and Holger Theisel and Hans-Peter Seidel}, title = {{Elastic Secondary Deformations by Vector Field Integration }}, pages = {99-108}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/099-108.pdf}, DOI = {10.2312/SGP/SGP07/099-108}, abstract = {We present an approach for elastic secondary deformations of shapes described as triangular meshes. The deformations are steered by the simulation of a low number of simple mass-spring sets. The result of this simulation is used to define time-dependent divergence-free vector fields whose numerical path line integration gives the new location of each vertex. This way the deformation is guaranteed to be volume-preserving and without self-intersections, giving plausible elastic deformations. Due to a GPU implementation, the deformation can be obtained in real-time for fairly complex shapes. The approach also avoids unwanted intersections in the case of collisions in the primary animation. We demonstrate its accuracy, stableness and usefulness for different kinds of primary animations/deformations.} } @inproceedings{SGP07:109-116:2007, crossref = {SGP07-proc}, author = {Olga Sorkine and Marc Alexa}, title = {{As-Rigid-As-Possible Surface Modeling}}, pages = {109-116}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/109-116.pdf}, DOI = {10.2312/SGP/SGP07/109-116}, abstract = {Modeling tasks, such as surface deformation and editing, can be analyzed by observing the local behavior of the surface. We argue that defining a modeling operation by asking for rigidity of the local transformations is useful in various settings. Such formulation leads to a non-linear, yet conceptually simple energy formulation, which is to be minimized by the deformed surface under particular modeling constraints. We devise a simple iterative mesh editing scheme based on this principle, that leads to detail-preserving and intuitive deformations. Our algorithm is effective and notably easy to implement, making it attractive for practical modeling applications.} } @inproceedings{SGP07:117-123:2007, crossref = {SGP07-proc}, author = {Yaron Lipman and Johannes Kopf and Daniel Cohen-Or and David Levin}, title = {{GPU-assisted Positive Mean Value Coordinates for Mesh Deformations }}, pages = {117-123}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/117-123.pdf}, DOI = {10.2312/SGP/SGP07/117-123}, abstract = {In this paper we introduce positive mean value coordinates (PMVC) for mesh deformation. Following the observations of Joshi et al. [JMD*07] we show the advantage of having positive coordinates. The control points of the deformation are the vertices of a "cage" enclosing the deformed mesh. To define positive mean value coordinates for a given vertex, the visible portion of the cage is integrated over a sphere. Unlike MVC [JSW05], PMVC are computed numerically. We show how the PMVC integral can be efficiently computed with graphics hardware. While the properties of PMVC are similar to those of Harmonic coordinates [JMD*07], the setup time of the PMVC is only of a few seconds for typical meshes with 30K vertices. This speed-up renders the new coordinates practical and easy to use.} } @inproceedings{SGP07:125-133:2007, crossref = {SGP07-proc}, author = {Michael Kazhdan and Allison Klein and Ketan Dalal and Hugues Hoppe}, title = {{Unconstrained Isosurface Extraction on Arbitrary Octrees }}, pages = {125-133}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/125-133.pdf}, DOI = {10.2312/SGP/SGP07/125-133}, abstract = {This paper presents a novel algorithm for generating a watertight level-set from an octree. We show that the level- set can be efficiently extracted regardless of the topology of the octree or the values assigned to the vertices. The key idea behind our approach is the definition of a set of binary edge-trees derived from the octree?s topology. We show that the edge-trees can be used define the positions of the isovalue-crossings in a consistent fashion and to resolve inconsistencies that may arise when a single edge has multiple isovalue-crossings. Using the edge-trees, we show that a provably watertight mesh can be extracted from the octree without necessitating the refinement of nodes or modification of their values.} } @inproceedings{SGP07:135-141:2007, crossref = {SGP07-proc}, author = {Rhaleb Zayer and Bruno Levy and Hans-Peter Seidel}, title = {{Linear Angle Based Parameterization }}, pages = {135-141}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/135-141.pdf}, DOI = {10.2312/SGP/SGP07/135-141}, abstract = {In the field of mesh parameterization, the impact of angular and boundary distortion on parameterization quality have brought forward the need for robust and efficient free boundary angle preserving methods. One of the most prominent approaches in this direction is the Angle Based Flattening (ABF) which directly formulates the problem as a constrained nonlinear optimization in terms of angles. Since the original formulation of the ABF, a steady research effort has been dedicated to improving its efficiency. As for any well posed numerical problem, the solution is generally an approximation of the underlying mathematical equations. The economy and accuracy of the solution are to a great extent affected by the kind of approximation used. In this work we reformulate the problem based on the notion of error of estimation. A careful manipulation of the resulting equations yields for the first time a linear version of angle based parameterization. The error induced by this linearization is quadratic in terms of the error in angles and the validity of the approximation is further supported by numerical results. Besides performance speedup, the simplicity of the current setup makes re-implementation and reproduction of our results straightforward.} } @inproceedings{SGP07:143-152:2007, crossref = {SGP07-proc}, author = {Hale Erten and Alper Uengoer}, title = {{Triangulations with Locally Optimal Steiner Points }}, pages = {143-152}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/143-152.pdf}, DOI = {10.2312/SGP/SGP07/143-152}, abstract = {We present two new Delaunay refinement algorithms, the second an extension of the first. For a given input domain (a set of points in the plane or a planar straight line graph), and a threshold angle a, the Delaunay refinement algorithms compute triangulations that have all angles at least a. Our algorithms have the same theoretical guarantees as the previous Delaunay refinement algorithms. The original Delaunay refinement algorithm of Ruppert is proven to terminate with size-optimal quality triangulations for a = 20.7 degrees. In practice, it generally works for a = 34 degrees and fails to terminate for larger constraint angles. The new Delaunay refinement algorithm generally terminates for constraint angles up to 42 degrees. Experiments also indicate that our algorithm computes significantly (almost by a factor of two) smaller triangulations than the output of the previous Delaunay refinement algorithms.} } @inproceedings{SGP07:153-162:2007, crossref = {SGP07-proc}, author = {Scott Schaefer and Can Yuksel}, title = {{Example-Based Skeleton Extraction }}, pages = {153-162}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/153-162.pdf}, DOI = {10.2312/SGP/SGP07/153-162}, abstract = {We present a method for extracting a hierarchical, rigid skeleton from a set of example poses. We then use this skeleton to not only reproduce the example poses, but create new deformations in the same style as the examples. Since rigid skeletons are used by most 3D modeling software, this skeleton and the corresponding vertex weights can be inserted directly into existing production pipelines. To create the skeleton, we first estimate the rigid transformations of the bones using a fast, face clustering approach. We present an efficient method for clustering by providing a Rigid Error Function that finds the best rigid transformation from a set of points in a robust, space efficient manner and supports fast clustering operations. Next, we solve for the vertex weights and enforce locality in the resulting weight distributions. Finally, we use these weights to determine the connectivity and joint locations of the skeleton.} } @inproceedings{SGP07:163-172:2007, crossref = {SGP07-proc}, author = {Kenneth Rose and Alla Sheffer and Jamie Wither and Marie-Paule Cani and Boris Thibert}, title = {{Developable Surfaces from Arbitrary Sketched Boundaries }}, pages = {163-172}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/163-172.pdf}, DOI = {10.2312/SGP/SGP07/163-172}, abstract = {We present a method for extracting a hierarchical, rigid skeleton from a set of example poses. We then use this skeleton to not only reproduce the example poses, but create new deformations in the same style as the examples. Since rigid skeletons are used by most 3D modeling software, this skeleton and the corresponding vertex weights can be inserted directly into existing production pipelines. To create the skeleton, we first estimate the rigid transformations of the bones using a fast, face clustering approach. We present an efficient method for clustering by providing a Rigid Error Function that finds the best rigid transformation from a set of points in a robust, space efficient manner and supports fast clustering operations. Next, we solve for the vertex weights and enforce locality in the resulting weight distributions. Finally, we use these weights to determine the connectivity and joint locations of the skeleton.} } @inproceedings{SGP07:173-182:2007, crossref = {SGP07-proc}, author = {Niloy J. Mitra and Simon Floery and Maks Ovsjanikov and Natasha Gelfand and Leonidas Guibas and Helmut Pottmann}, title = {{Dynamic Geometry Registration }}, pages = {173-182}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/173-182.pdf}, DOI = {10.2312/SGP/SGP07/173-182}, abstract = {We propose an algorithm that performs registration of large sets of unstructured point clouds of moving and deforming objects without computing correspondences. Given as input a set of frames with dense spatial and temporal sampling, such as the raw output of a fast scanner, our algorithm exploits the underlying temporal coherence in the data to directly compute the motion of the scanned object and bring all frames into a common coordinate system. In contrast with existing methods which usually perform pairwise alignments between consecutive frames, our algorithm computes a globally consistent motion spanning multiple frames. We add a time coordinate to all the input points based on the ordering of the respective frames and pose the problem of computing the motion of each frame as an estimation of certain kinematic properties of the resulting space-time surface. By performing this estimation for each frame as a whole we are able to compute rigid inter-frame motions, and by adapting our method to perform a local analysis of the space-time surface, we extend the basic algorithm to handle registration of deformable objects as well. We demonstrate the performance of our algorithm on a number of synthetic and scanned examples, each consisting of hundreds of scans.} } @inproceedings{SGP07:183-192:2007, crossref = {SGP07-proc}, author = {Ilya Eckstein and Jean-Philippe Pons and Yiying Tong and C.-C. Jay Kuo and Mathieu Desbrun}, title = {{Generalized Surface Flows for Mesh Processing }}, pages = {183-192}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/183-192.pdf}, DOI = {10.2312/SGP/SGP07/183-192}, abstract = {Geometric flows are ubiquitous in mesh processing. Curve and surface evolutions based on functional minimization have been used in the context of surface diffusion, denoising, shape optimization, minimal surfaces, and geodesic paths to mention a few. Such gradient flows are nearly always, yet often implicitly, based on the canonical L2 inner product of vector fields. In this paper, we point out that changing this inner product provides a simple, powerful, and untapped approach to extend current flows. We demonstrate the value of such a norm alteration for regularization and volume-preservation purposes and in the context of shape matching, where deformation priors (ranging from rigid motion to articulated motion) can be incorporated into a gradient flow to drastically improve results. Implementation details, including a differentiable approximation of the Hausdorff distance between irregular meshes, are presented.} } @inproceedings{SGP07:193-202:2007, crossref = {SGP07-proc}, author = {Elif Tosun and Yotam I. Gingold and Jason Reisman and Denis Zorin}, title = {{Shape Optimization Using Reflection Lines }}, pages = {193-202}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/193-202.pdf}, DOI = {10.2312/SGP/SGP07/193-202}, abstract = {Many common objects have highly reflective metallic or painted finishes. Their appearance is primarily defined by the distortion the curved shape of the surface introduces in the reflections of surrounding objects. Reflection lines are commonly used for surface interrogation, as they capture many essential aspects of reflection distortion directly, and clearly show surface imperfections that may be hard to see with conventional lighting. In this paper, we propose the use of functionals based on reflection lines for mesh optimization and editing. We describe a simple and efficient discretization of such functionals based on screen-space surface parameterization, and we demonstrate how such discrete functionals can be used for several types of surface editing operations.} } @inproceedings{SGP07:203-212:2007, crossref = {SGP07-proc}, author = {Klaus Hildebrandt and Konrad Polthier}, title = {{Constraint-based Fairing of Surface Meshes }}, pages = {203-212}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/203-212.pdf}, DOI = {10.2312/SGP/SGP07/203-212}, abstract = {We propose a constraint-based method for the fairing of surface meshes. The main feature of our approach is that the resulting smoothed surface remains within a prescribed distance to the input mesh. For example, specifying the maximum distance in the order of the measuring precision of a laser scanner allows noise to be removed while preserving the accuracy of the scan. The approach is modeled as an optimization problem where a fairness measure is minimized subject to constraints that control the spatial deviation of the surface. The problem is efficiently solved by an active set Newton method.} } @inproceedings{SGP07:213-223:2007, crossref = {SGP07-proc}, author = {Qi-Xing Huang and Bart Adams and Michael Wand}, title = {{Bayesian Surface Reconstruction via Iterative Scan Alignment to an Optimized Prototype }}, pages = {213-223}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/213-223.pdf}, DOI = {10.2312/SGP/SGP07/213-223}, abstract = {This paper introduces a novel technique for joint surface reconstruction and registration. Given a set of roughly aligned noisy point clouds, it outputs a noise-free and watertight solid model. The basic idea of the new technique is to reconstruct a prototype surface at increasing resolution levels, according to the registration accuracy obtained so far, and to register all parts with this surface. We derive a non-linear optimization problem from a Bayesian formulation of the joint estimation problem. The prototype surface is represented as a partition of unity implicit surface, which is constructed from piecewise quadratic functions defined on octree cells and blended together using B-spline basis functions, allowing the representation of objects with arbitrary topology with high accuracy. We apply the new technique to a set of standard data sets as well as especially challenging real-world cases. In practice, the novel prototype surface based joint reconstruction-registration algorithm avoids typical convergence problems in registering noisy range scans and substantially improves the accuracy of the final output.} } @inproceedings{SGP07:225-233:2007, crossref = {SGP07-proc}, author = {Raif M. Rustamov}, title = {{Laplace-Beltrami Eigenfunctions for Deformation Invariant Shape Representation }}, pages = {225-233}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/225-233.pdf}, DOI = {10.2312/SGP/SGP07/225-233}, abstract = {A deformation invariant representation of surfaces, the GPS embedding, is introduced using the eigenvalues and eigenfunctions of the Laplace-Beltrami differential operator. Notably, since the definition of the GPS embedding completely avoids the use of geodesic distances, and is based on objects of global character, the obtained representation is robust to local topology changes. The GPS embedding captures enough information to handle various shape processing tasks as shape classification, segmentation, and correspondence. To demonstrate the practical relevance of the GPS embedding, we introduce a deformation invariant shape descriptor called G2-distributions, and demonstrate their discriminative power, invariance under natural deformations, and robustness.} } @inproceedings{SGP07:235-242:2007, crossref = {SGP07-proc}, author = {Joshua Podolak and Aleksey Golovinskiy and Szymon Rusinkiewicz}, title = {{Symmetry-Enhanced Remeshing of Surfaces }}, pages = {235-242}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/235-242.pdf}, DOI = {10.2312/SGP/SGP07/235-242}, abstract = {While existing methods for 3D surface approximation use local geometric properties, we propose that more intuitive results can be obtained by considering global shape properties such as symmetry. We modify the Variational Shape Approximation technique to consider the symmetries, near-symmetries, and partial symmetries of the input mesh. This has the effect of preserving and even enhancing symmetries in the output model, if doing so does not increase the error substantially. We demonstrate that using symmetry produces results that are more aesthetically appealing and correspond more closely to human expectations, especially when simplifying to very few polygons.} } @inproceedings{SGP07:243-251:2007, crossref = {SGP07-proc}, author = {Jochen Suessmuth and Guenther Greiner}, title = {{Ridge Based Curve and Surface Reconstruction }}, pages = {243-251}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/243-251.pdf}, DOI = {10.2312/SGP/SGP07/243-251}, abstract = {This paper presents a new method for reconstructing curves and surfaces from unstructured point clouds, allowing for noise in the data as well as inhomogeneous distribution of the point set. It is based on the observation that the curve/surface is located where locally the point cloud has highest density. This idea is pursued by a differential geometric analysis of a smoothed version of the density function. More precisely we detect ridges of this function and have to single out the relevant parts. An efficient implementation of this approach evaluates the differential geometric quantities on a regular grid, performs local analysis and finally recovers the curve/surface by an isoline extraction or a marching cubes algorithm respectively. Compared to existing surface reconstruction procedures, this approach works well for noisy data and for data with strongly varying sampling rate. Thus it can be applied successfully to reconstruct surface geometry from time-of-flight data, overlapping registered point clouds and point clouds obtained by feature tracking from video streams. Corresponding examples are presented to demonstrate the advantages of our method.} } @inproceedings{SGP07:253-262:2007, crossref = {SGP07-proc}, author = {Ran Gal and Ariel Shamir and Tal Hassner and Mark Pauly and Daniel Cohen Or}, title = {{Surface Reconstruction using Local Shape Priors }}, pages = {253-262}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/253-262.pdf}, DOI = {10.2312/SGP/SGP07/253-262}, abstract = {We present an example-based surface reconstruction method for scanned point sets. Our approach uses a database of local shape priors built from a set of given context models that are chosen specifically to match a specific scan. Local neighborhoods of the input scan are matched with enriched patches of these models at multiple scales. Hence, instead of using a single prior for reconstruction, our method allows specific regions in the scan to match the most relevant prior that fits best. Such high confidence matches carry relevant information from the prior models to the scan, including normal data and feature classification, and are used to augment the input point-set. This allows to resolve many ambiguities and difficulties that come up during reconstruction, e.g., distinguishing between signal and noise or between gaps in the data and boundaries of the model. We demonstrate how our algorithm, given suitable prior models, successfully handles noisy and under-sampled point sets, faithfully reconstructing smooth regions as well as sharp features.} } @inproceedings{SGP07:263-272:2007, crossref = {SGP07-proc}, author = {E. J. Griffith and M. Koutek and Frits H. Post}, title = {{Fast Normal Vector Compression with Bounded Error }}, pages = {263-272}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/263-272.pdf}, DOI = {10.2312/SGP/SGP07/263-272}, abstract = {We present two methods for lossy compression of normal vectors through quantization using ?base? polyhedra. The first revisits subdivision-based quantization. The second uses fixed-precision barycentric coordinates. For both, we provide fast (de)compression algorithms and a rigorous upper bound on compression error. We discuss the effects of base polyhedra on the error bound and suggest polyhedra derived from spherical coverings. Finally, we present compression and decompression results, and we compare our methods to others from the literature.} } @inproceedings{SGP07:273-282:2007, crossref = {SGP07-proc}, author = {Ramsay Dyer and Hao Zhang and Torsten Moeller}, title = {{Delaunay Mesh Construction }}, pages = {273-282}, URL = {http://www.eg.org/EG/DL/WS/SGP/SGP07/273-282.pdf}, DOI = {10.2312/SGP/SGP07/273-282}, abstract = {We present algorithms to produce Delaunay meshes from arbitrary triangle meshes by edge flipping and geometrypreserving refinement and prove their correctness. In particular we show that edge flipping serves to reduce mesh surface area, and that a poorly sampled input mesh may yield unflippable edges necessitating refinement to ensure a Delaunay mesh output. Multiresolution Delaunay meshes can be obtained via constrained mesh decimation. We further examine the usefulness of trading off the geometry-preserving feature of our algorithm with the ability to create fewer triangles. We demonstrate the performance of our algorithms through several experiments.} } @proceedings{SGP07-proc, editor = {Alexander Belyaev and Michael Garland}, title = {SGP07: Eurographics Symposium on Geometry Processing}, year = {2007}, isbn = {978-3-905673-46-3}, issn = {1727-8384}, address = {Barcelona, Spain}, publisher = {Eurographics Association} }