Abstract
In this paper, a general scheme for solving coherent geometric queries on freeform geometry is presented and demonstrated on a variety of problems common in geometric modeling. The underlying strategy of the approach is to lift the domain of the problem into a higher-dimensional space to enable analysis on the continuum of all possible configurations of the geometry. This higher-dimensional space supports analysis of changes to solution topology by solving for critical points using a B-spline-based constraint solver. The critical points are then used to guide fast, local methods to robustly update repeated queries. This approach effectively combines the speed of local updates with the robustness of global search solutions. The effectiveness of the domain lifting scheme (DLS) is demonstrated on several geometric computations, including accurately generating offset curves and finding minimum distances. Our approach requires a preprocessing step that computes the critical points, but once the topology is analyzed, an arbitrary number of geometry queries can be solved using fast local methods. Experimental results show that the approach solves for several hundred minimum distance computations between planar curves in one second and results in a hundredfold speedup for trimming self-intersections in offset curves.
Original language | English |
---|---|
Pages (from-to) | 613-624 |
Number of pages | 12 |
Journal | CAD Computer Aided Design |
Volume | 42 |
Issue number | 7 |
DOIs | |
Publication status | Published - 2010 Jul |
Externally published | Yes |
Keywords
- Critical point analysis
- Dimensionality lifting
- Offsets
- Problem reduction scheme
- Self-intersections
- Shortest distance
- Spline models
ASJC Scopus subject areas
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Industrial and Manufacturing Engineering