A fast algorithm for an envelope construction of a huge set of topologically consistent polygons (Q2575283)
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: A fast algorithm for an envelope construction of a huge set of topologically consistent polygons |
scientific article; zbMATH DE number 2236987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for an envelope construction of a huge set of topologically consistent polygons |
scientific article; zbMATH DE number 2236987 |
Statements
A fast algorithm for an envelope construction of a huge set of topologically consistent polygons (English)
0 references
8 December 2005
0 references
envelope of polygons
0 references
computational geometry
0 references
graphical examples
0 references
algorithm
0 references
geographic information systems
0 references
two-level uniform plane subdivision
0 references
0.7653858065605164
0 references
0.7653793692588806
0 references
0.7619609236717224
0 references
0.7372070550918579
0 references
0.7299668192863464
0 references
