Author image not provided
 Simon Flöry

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article22.10
Citation Count221
Publication count10
Publication years2006-2013
Available for download4
Average downloads per article1,358.50
Downloads (cumulative)5,434
Downloads (12 Months)295
Downloads (6 Weeks)25
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


10 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 10 of 10
Sort by:

1 published by ACM
February 2013 ACM Transactions on Graphics (TOG): Volume 32 Issue 1, January 2013
Publisher: ACM
Bibliometrics:
Citation Count: 25
Downloads (6 Weeks): 10,   Downloads (12 Months): 83,   Downloads (Overall): 862

Full text available: PDFPDF
In this article, we introduce a novel reconstruction and modeling pipeline to create polygonal models from unstructured point clouds. We propose an automatic polygonal reconstruction that can then be interactively refined by the user. An initial model is automatically created by extracting a set of RANSAC-based locally fitted planar primitives ...
Keywords: interactive modeling, geometric optimization, Surface reconstruction

2
September 2010 MICCAI'10: Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part III
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

We propose a shape descriptor for 3D ear impressions, derived from a comprehensive set of anatomical features. Motivated by hearing aid (HA) manufacturing, the selection of the anatomical features is carried out according to their uniqueness and importance in HA design. This leads to a canonical ear signature that is ...

3
January 2010 Computer Aided Geometric Design: Volume 27 Issue 1, January, 2010
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 9

Many problems in computer aided geometric design and geometry processing are stated as least-squares optimizations. Least-squares problems are well studied and widely used but exhibit immanent drawbacks such as high sensitivity to outliers. For this reason, we consider techniques for the registration of point clouds and surface fitting to point ...
Keywords: Linear program, Surface fitting, l1-approximation, Second-order cone programming, Curve fitting, Optimization, Proximal bundle method, Registration

4 published by ACM
July 2009 Journal on Computing and Cultural Heritage (JOCCH): Volume 2 Issue 1, July 2009
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Downloads (Overall): 636

Full text available: PDFPDF
Anastylosis is the archaeological and architectural reconstruction of a ruined monument at the historic site after careful study of the remaining original elements. We present research results concerning 3D technologies that are used in the digital anastylosis of cultural heritage monuments. Based on current state-of-the-art research, we present 3D data ...
Keywords: Anastylosis, 3D data acquisition, digital reassembly, digital surface reconstruction, global and local registration, visual computing

5
February 2009 Computer Aided Geometric Design: Volume 26 Issue 2, February, 2009
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 7

We consider the problem of fitting B-spline curves and surfaces to point clouds in the presence of obstacles constraining this approximation at the same time. Therefore, we describe the fitting problem as optimization problem and employ an iterative procedure to solve it-the presence of obstacles poses constraints on this minimization ...
Keywords: Surface fitting, Surface trimming, Constrained optimization, Curve fitting, Obstacles

6 published by ACM
August 2008 ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH 2008: Volume 27 Issue 3, August 2008
Publisher: ACM
Bibliometrics:
Citation Count: 46
Downloads (6 Weeks): 7,   Downloads (12 Months): 104,   Downloads (Overall): 1,567

Full text available: PDFPDF
Fascinating and elegant shapes may be folded from a single planar sheet of material without stretching, tearing or cutting, if one incorporates curved folds into the design. We present an optimization-based computational framework for design and digital reconstruction of surfaces which can be produced by curved folding. Our work not ...
Keywords: architectural geometry, curved fold, computational differential geometry, computational origami, digital reconstruction, folding, industrial design, isometry, developable surface
Also published in:
August 2008  SIGGRAPH '08: ACM SIGGRAPH 2008 papers

7
January 2008 Computer-Aided Design: Volume 40 Issue 1, January, 2008
Publisher: Butterworth-Heinemann
Bibliometrics:
Citation Count: 8

When designing curves on surfaces the need arises to approximate a given noisy target shape by a smooth fitting shape. We discuss the problem of fitting a B-spline curve to a point cloud by squared distance minimization in the case that both the point cloud and the fitting curve are ...
Keywords: Constrained optimization, Curve fitting, Shape approximation, B-spline curve, Free-form curves, Squared distance minimization, Constrained curve design, Geometric constraints, Splines on manifolds, Damped Gauss-Newton method

8 published by ACM
August 2007 SIGGRAPH '07: ACM SIGGRAPH 2007 posters
Publisher: ACM
Bibliometrics:
Citation Count: 0

As demonstrated in our work [Huang et al. 2006] fracture surfaces of broken solids contain rich geometric information that are sufficient for reassembly based on geometric matching. However, the task of reassembling an ancient monument from its building blocks differs significantly from that of reassembling a broken solid. These building ...

9
July 2007 SGP '07: Proceedings of the fifth Eurographics symposium on Geometry processing
Publisher: Eurographics Association
Bibliometrics:
Citation Count: 42

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 ...

10 published by ACM
July 2006 ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH 2006: Volume 25 Issue 3, July 2006
Publisher: ACM
Bibliometrics:
Citation Count: 77
Downloads (6 Weeks): 7,   Downloads (12 Months): 91,   Downloads (Overall): 2,369

Full text available: PDFPDF
We present a system for automatic reassembly of broken 3D solids. Given as input 3D digital models of the broken fragments, we analyze the geometry of the fracture surfaces to find a globally consistent reconstruction of the original object. Our reconstruction pipeline consists of a graph-cuts based segmentation algorithm for ...
Keywords: feature-based registration, non-penetrating alignment, geometric matching, 3D puzzle, integral invariants
Also published in:
July 2006  SIGGRAPH '06: ACM SIGGRAPH 2006 Papers



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us