Efficient algorithms for line and curve segment intersection using restricted predicates (Q1567304)
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: Efficient algorithms for line and curve segment intersection using restricted predicates |
scientific article; zbMATH DE number 1455636
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for line and curve segment intersection using restricted predicates |
scientific article; zbMATH DE number 1455636 |
Statements
Efficient algorithms for line and curve segment intersection using restricted predicates (English)
0 references
9 April 2001
0 references
intersection algorithms
0 references
curve segment intersection
0 references
0.90613043
0 references
0.8893353
0 references
0.8810849
0 references
0.8787027
0 references
0.86940867
0 references
0.8680126
0 references
0.86729693
0 references
0.8671687
0 references
0.86498976
0 references
0.86498976
0 references
