Algorithms for computing closest points for segments (Q6869864)
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 8149421
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for computing closest points for segments |
scientific article; zbMATH DE number 8149421 |
Statements
Algorithms for computing closest points for segments (English)
0 references
21 January 2026
0 references
closest points
0 references
Voronoi diagrams
0 references
line segments
0 references
Hopcroft's problem
0 references
decision trees
0 references
0 references
0 references
