Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE...
Transcript of Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE...
![Page 1: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/1.jpg)
1
Distance Functions
![Page 2: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/2.jpg)
2
Distance function
Given: geometric object F (curve, surface, solid, …)
Assigns to each point the shortest distance from F
Level sets of the distance function are trimmed offsets
F
p
![Page 3: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/3.jpg)
3
Graph surfaces of distance functions
Graph surfaces of distance functions: (developable) surfaces of constant slope
Each tangent plane has the inclination angle 45 degrees
Not smooth at the base curve and at the cut locus
![Page 4: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/4.jpg)
4
GEOMETRIE
squared distance function
For geometric optimization algorithms: local quadratic approximation of the squared distance function
Outside cut locus
![Page 5: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/5.jpg)
5
GEOMETRIE
local quadratic approximation of the function d2
quadratic Taylor approximant Fd of the squared distance function at p:
x1, x2 are the coordinates in the Frenet frame at the normal footpoint c(t0) of p.
![Page 6: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/6.jpg)
6
GEOMETRIE
quadratic approximation of d2
Taylor approximant
for d=0 (p on the curve): Squared distance to the tangent at c(t0)=p.
![Page 7: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/7.jpg)
7
GEOMETRIE
Second order approximant of the squared distance function
to a surface
The second order Taylor approximant Fd of the squared distance function to a surface at a point p is expressed in the principal frame at the normal footpoint s via
e1
e2
e3
s(u,v) p
s
![Page 8: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/8.jpg)
8
GEOMETRIE
Data structure
Adaptive data structure whose cells carry local quadratic approximants of the squared distance function
![Page 9: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/9.jpg)
9 www.geometrie.tuwien.ac.at
GEOMETRIE
Curve and surface fitting
![Page 10: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/10.jpg)
Institute of Geometry
10
Squared Distance Minimization I (H.P., M. Hofer, S. Leopoldseder,
Wenping Wang)
![Page 11: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/11.jpg)
11 www.geometrie.tuwien.ac.at
GEOMETRIE
Squared Distance Minimization
B-spline curve or surface is iteratively deformed in the squared distance field of the model shape M (shape to be approximated: point cloud, mesh, implicit curve/surface,…)
Errors measured orthogonal to M
M
![Page 12: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/12.jpg)
12 www.geometrie.tuwien.ac.at
GEOMETRIE
Algorithm overview
evaluate current B-spline form at discrete number of ‘sensor’ points sk
compute local quadratic approximants of the squared distance field d2 to M at sk
change control points such that sensors come closer to M (done with help of quadratic approximants to d2)
Iteration:
![Page 13: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/13.jpg)
13 www.geometrie.tuwien.ac.at
GEOMETRIE
Initialization and sensor points
Choose an initial shape s (B-spline curve or surface)
compute sufficient number of `sensor points sk’ on s (evaluation at chosen parameter values)
Note: if control points are displaced with vectors ci (knots and weights fixed), the new sensor locations sk
* depend linearly on ci
sk
![Page 14: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/14.jpg)
14 www.geometrie.tuwien.ac.at
GEOMETRIE
local quadratic approximants at sensor points
At each sensor point sk, compute a nonnegative local quadratic approximant to the squared distance field of model shape
sk
![Page 15: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/15.jpg)
15 www.geometrie.tuwien.ac.at
GEOMETRIE
move closer to model shape
Compute displacement vectors ci of the control points such that sensors come closer to model shape by minimizing
This is a quadratic function in ci
![Page 16: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/16.jpg)
16 www.geometrie.tuwien.ac.at
GEOMETRIE
Remarks For regularization and avoidance of
overlappings/foldings of the final shape, an adequately weighted smoothing term Fs can be added to the functional, e.g. for surfaces:
Amounts to minimization of quadratic
function
![Page 17: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/17.jpg)
17 www.geometrie.tuwien.ac.at
GEOMETRIE
Example: curve approximation
Displacement polygons of sensor points show that later moves are mainly in tangential direction
Related to the computation of a good parameterization
![Page 18: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/18.jpg)
18 www.geometrie.tuwien.ac.at
GEOMETRIE
Example: Offset approximation
Sensor points do NOT move towards offset along normals of the progenitor curve
![Page 19: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/19.jpg)
19 www.geometrie.tuwien.ac.at
GEOMETRIE
SDM, TDM, PDM
SDM employs curvature at closest point to compute 2nd order approximation of squared distance function
TDM uses only squared distance to tangent at footpoint (requires regularization and stepsize control)
PDM (mostly used) employs squared distances to footpoint
TDM regularized with a PDM term works very well
M
![Page 20: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/20.jpg)
20 www.geometrie.tuwien.ac.at
GEOMETRIE
SDM, TDM, PDM
SDM: Newton algorithm with quadratic convergence
TDM: Gauss-Newton iteration for nonlinear least squares problem; quadratic convergence for zero residual problem and good initial position; requires regularization (add multiple of identity matrix to approximate Hessian or add a PDM term with low weight) and step size control
PDM: only linearly convergent and prone to be trapped in local minimizer
![Page 21: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/21.jpg)
21 www.geometrie.tuwien.ac.at
GEOMETRIE
Example: NURBS surface approximation
Model surface (gold) and initial position of active NURBS surface (blue)
Final position of active NURBS surface (after 5 iterations).
![Page 22: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/22.jpg)
22 www.geometrie.tuwien.ac.at
GEOMETRIE Approximation with ruled surface
• active B-spline surface of degree (1,n)
![Page 23: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/23.jpg)
23 www.geometrie.tuwien.ac.at
GEOMETRIE
Approximation by a piecewise ruled surface
![Page 24: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/24.jpg)
24 www.geometrie.tuwien.ac.at
GEOMETRIE
Application of ruled surface approximation
hot wire cutting (styrofoam)
wire EDM (metal)
![Page 25: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/25.jpg)
Institute of Geometry
25
Squared Distance Minimization II (W. Wang, D. Cheng, Y. Liu, H. P.)
![Page 26: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/26.jpg)
26 www.geometrie.tuwien.ac.at
GEOMETRIE
Another type of SDM
Error measurement orthogonal to the active curve/surface
Squared distance field (quadratic approximants) attached to the moving curve/surface
Quasi-Newton method (neglects rotation of tangent and change of curvature)
d2=(X0-P)T.Q.(X0-P) d2=(X0-PD)T.Q.(X0-PD)
![Page 27: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/27.jpg)
27 www.geometrie.tuwien.ac.at
GEOMETRIE
simplifications
TDM: measures the error via squared distance to tangent at closest point; requires regularization and step size control
PDM (standard approach): measures error via squared distance to closest point
TDM regularized with a PDM term (small weight) works very well
![Page 28: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/28.jpg)
28 www.geometrie.tuwien.ac.at
GEOMETRIE
Example 1: Non-uniform data
SDM after 8 iterations Initial position
![Page 29: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/29.jpg)
29 www.geometrie.tuwien.ac.at
GEOMETRIE
Example 2: Thick point cloud
SDM after 31 iterations Initial position
![Page 30: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/30.jpg)
30 www.geometrie.tuwien.ac.at
GEOMETRIE
Noisy data set; 50 iterations
Initial position
TDM no regularization
PDM SDM
![Page 31: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/31.jpg)
31 www.geometrie.tuwien.ac.at
GEOMETRIE
Comparison of PDM and SDM after 50 iteration steps
Point Distance Min. (PDM) SDM
![Page 32: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/32.jpg)
32 www.geometrie.tuwien.ac.at
GEOMETRIE
Comparison: PDM vs. SDM
Target shape and Initial position
PDM after 20 iterations SDM after 20 iterations
![Page 33: Institut für Geometrie Technische Universität Wien ... · 1. e 2. e 3. s (u,v) p. s. 8 GEOMETRIE Data structure Adaptive data structure whose cells carry local quadratic approximants](https://reader030.fdocuments.net/reader030/viewer/2022040206/5d5112f088c9939f798be864/html5/thumbnails/33.jpg)
33 www.geometrie.tuwien.ac.at
GEOMETRIE
Convergence behavior
Standard method (PDM): linear convergence SDM: quadratic convergence
PDM SDM
3D visualization of the curve evolution