Author image not provided
 Michael Hofer

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article15.00
Citation Count270
Publication count18
Publication years2002-2010
Available for download5
Average downloads per article942.80
Downloads (cumulative)4,714
Downloads (12 Months)157
Downloads (6 Weeks)6
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


18 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 18 of 18
Sort by:

1
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

2 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

3
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

4
October 2007 SIBGRAPI '07: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

Dental biometrics is used in forensic dentistry to identify or verify persons based on their dental radiographs. This paper presents a method for human identification based on dental work information. The proposed method works with three main processing steps: segmentation (feature extraction), creation of a dental code, and matching. In ...

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

6 published by ACM
April 2007 SCCG '07: Proceedings of the 23rd Spring Conference on Computer Graphics
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 7,   Downloads (Overall): 24

Full text available: PDFPDF
We survey recent research results in constrained optimization with curves and curve networks. The addressed topics include constrained variational curve and curve network design, variational motion design, and guaranteed error bound approximation of point cloud data with curve networks. The main theoretic results are summarized with a focus on geometric ...
Keywords: curves on surfaces, splines, variational design, approximation, curve networks, interpolation, constrained optimization

7
December 2006 The Visual Computer: International Journal of Computer Graphics: Volume 23 Issue 1, December 2006
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 5

Fair webs are energy-minimizing curve networks. Obtained via an extension of cubic splines or splines in tension to networks of curves, they are efficiently computable and possess a variety of interesting applications. We present properties of fair webs and their discrete counterparts, i.e., fair polygon networks. Applications of fair curve ...
Keywords: Obstacle avoidance, Aesthetic meshes, Curves in surfaces, Mesh fairing, Spline interpolation and approximation, Curve network, Texture mapping, Variational surface design

8 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): 3,   Downloads (12 Months): 92,   Downloads (Overall): 2,370

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

9
October 2005 Computer Aided Geometric Design - Special issue: Geometric modelling and differential geometry: Volume 22 Issue 7, October 2005
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 7

Given an m-dimensional surface @F in R^n, we characterize parametric curves in @F, which interpolate or approximate a sequence of given points p"[email protected][email protected] and minimize a given energy functional. As energy functionals we study familiar functionals from spline theory, which are linear combinations of L^2 norms of certain derivatives. The ...
Keywords: Curves in manifolds, Shape optimization, Spline approximation, Spline interpolation, Variational curve design

10
October 2005 Computer Aided Geometric Design - Special issue: Geometric modelling and differential geometry: Volume 22 Issue 7, October 2005
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 5

Given an m -dimensional surface Φ in R n , we characterize parametric curves in Φ which interpolate or approximate a sequence of given points p i ∈ Φ and minimize a given energy functional. As energy functionals we study familiar functionals from spline theory, which are linear combinations of ...
Keywords: curves in manifolds, spline interpolation, shape optimization, spline approximation, variational curve design

11 published by ACM
July 2005 SIGGRAPH '05: ACM SIGGRAPH 2005 Sketches
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 3,   Downloads (Overall): 59

Full text available: PDFPDF
Fair curve networks in nonlinear geometries are an extension of our work [Hofer and Pottmann 2004] on energy-minimizing spline curves in manifolds. Instead of designing with one single curve, we here present a variational approach for the design with an entire network of curves. After a geometric characterization of fair, ...

12
June 2005 Computer-Aided Design: Volume 37 Issue 7, June, 2005
Publisher: Butterworth-Heinemann
Bibliometrics:
Citation Count: 29

Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CAM, Geometric Modelling, Robotics, Computer Vision and Image Processing, Computer Graphics and Scientific Visualization. In this paper, Industrial Geometry is illustrated via the fruitful ...
Keywords: Geometric optimization, Feature sensitivity, Surface approximation, Active contours, Distance function, Mathematical morphology, Curve approximation, Registration

13 published by ACM
August 2004 ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH 2004: Volume 23 Issue 3, August 2004
Publisher: ACM
Bibliometrics:
Citation Count: 42
Downloads (6 Weeks): 2,   Downloads (12 Months): 38,   Downloads (Overall): 1,625

Full text available: PDFPDF
Variational interpolation in curved geometries has many applications, so there has always been demand for geometrically meaningful and efficiently computable splines in manifolds. We extend the definition of the familiar cubic spline curves and splines in tension, and we show how to compute these on parametric surfaces, level sets, triangle ...
Keywords: motion design, variational curve design, geometric optimization, obstacle avoidance, splines in manifolds
Also published in:
August 2004  SIGGRAPH '04: ACM SIGGRAPH 2004 Papers

14
July 2004 The Visual Computer: International Journal of Computer Graphics: Volume 20 Issue 5, July 2004
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 12

We discuss the following problem, which arises in computer animation and robot motion planning: given are N positions or keyframes Σ(t i ) of a moving body Σ⊂ℝ 3 at time instances t i . Compute a smooth rigid body motion Σ(t) that interpolates or approximates the given positions Σ(t ...
Keywords: Motion planning, Variational design, Motion design, Registration, Subdivision algorithm

15
July 2004 The Visual Computer: International Journal of Computer Graphics: Volume 20 Issue 5, July 2004
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We discuss the following problem, which arises in computer animation and robot motion planning: given are N positions or keyframes Σ(ti) of a moving body Σ��3 at time instances ti. Compute a smooth rigid body motion Σ(t) that interpolates or approximates the given positions Σ(ti) such that chosen feature points ...
Keywords: Motion planning, Variational design, Motion design, Registration, Subdivision algorithm

16
July 2004 Computer Vision and Image Understanding: Volume 95 Issue 1, July 2004
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 25

We present a new approach to the geometric alignment of a point cloud to a surface and to related registration problems. The standard algorithm is the familiar ICP algorithm. Here, we provide an alternative concept which relies on instantaneous kinematics and on the geometry of the squared distance function of ...
Keywords: geometric optimization, squared distance function, instantaneous kinematics, registration

17
December 2003 Computer Aided Geometric Design: Volume 20 Issue 8-9, December 2003
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 5

We discuss the following problem which arises in robot motion planning, NC machining and computer animation: Given are a fixed surface Φ and N positions Φ i of a moving surface Φ such that the Φ i are in point contact with Ψ. Compute a smooth and fair Euclidean gliding ...
Keywords: motion design, gliding motion, kinematics, variational subdivision, line geometry

18
October 2002 PG '02: Proceedings of the 10th Pacific Conference on Computer Graphics and Applications
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 37

An active contour model for parametric curve and surface approximation is presented. The active curve or surface adapts to the model shape to be approximated in an optimization algorithm. The quasi-Newton optimization procedure in each iteration step minimizes a quadratic function which is built up with help of local quadratic ...



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