Fundamentals of computer aided geometric design
Fundamentals of computer aided geometric design
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Computational Line Geometry
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
A simple algorithm for designing developable Bézier surfaces
Computer Aided Geometric Design
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Given a closed plane curve c(t) = (c1,c2) (t) ∈ &egr; R2 and associated function values g(t) we present a geometric idea and an algorithm to solve the equation ||∇f|| = a = const. with respect to the boundary values g(t) along the boundary c(t). This is equivalent to finding a developable surface D of constant slope a = tan α through the spatial curve C determined by (c1, c2, g) (t). The presented method constructs level curves of the surface D. We put some emphasis on the treatment of the singularities of the solution which are D's self intersections.