A set operation algorithm for sculptured solids modeled with trimmed patches (Q1122931)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4108001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A set operation algorithm for sculptured solids modeled with trimmed patches |
scientific article; zbMATH DE number 4108001 |
Statements
A set operation algorithm for sculptured solids modeled with trimmed patches (English)
0 references
1989
0 references
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.
0 references
computer aided design
0 references
trimmed patches
0 references
computer graphics
0 references
algorithm
0 references
combinatorial structure
0 references
0.7529309391975403
0 references
0.752800703048706
0 references
