On determining start points for a surface/surface intersection algorithm.
Gregor MüllenheimPublished in: Comput. Aided Geom. Des. (1991)
Keyphrases
- surface fitting
- learning algorithm
- triangular mesh
- delaunay triangulation
- detection algorithm
- preprocessing
- search space
- k means
- expectation maximization
- objective function
- optimal solution
- convex hull
- planar patches
- high curvature
- smooth surfaces
- surface model
- reconstruction method
- geodesic distance
- matching algorithm
- segmentation algorithm
- boundary points
- surface meshes
- dynamic programming
- parametric curves
- cost function
- three dimensional