A set operation algorithm for sculptured solids modeled with trimmed patches
It has long been standard practice in differential geometry to define a surface by a set of charts, maps of the unit square into three-space. If the surface is defined not by charts based on open sets but on nonoverlapping closed sets then the charts are called trimmed patches in computer graphics. The authors develop an algorithm to compute union, intersection and set difference of surfaces based on trimmed patches. The relatively simple combinatorial structure of the procedure shows that general trimmed patches are a useful tool in CAD.
- Algorithm for algebraic curve intersection
- scientific article; zbMATH DE number 4092633 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Implementation of a divide-and-conquer method for intersection of parametric surfaces
- Surface/surface intersection
- Tracing surface intersections
- Boolean operations between solids and surfaces by octrees: Models and algorithm
- Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques
- Single-valued tubular patches
- Coons-patch macroelements in two-dimensional parabolic problems
- Feature-aware reconstruction of trimmed splines using Ricci flow with metric optimization
- scientific article; zbMATH DE number 4195221 (Why is no real title available?)
- Generalizing Active Zones for Set-Theoretic Solid Models
- Second-order surface analysis using hybrid symbolic and numeric operators
- ROBUST SET OPERATIONS ON POLYHEDRAL SOLIDS: A FIXED PRECISION APPROACH
- Numerical and analytical method for the design of piezoelectric modal sensors/actuators for shell‐type structures
This page was built for publication: A set operation algorithm for sculptured solids modeled with trimmed patches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122931)