Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms (Q3358264)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms |
scientific article |
Statements
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms (English)
0 references
1990
0 references
reliability
0 references
robustness
0 references
degenerate data
0 references
determinants
0 references
perturbation
0 references
programming tool
0 references
geometric algorithms
0 references
geometric software
0 references
0.8525749
0 references
0.84740144
0 references
0.8431268
0 references
