FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE (Q5694056): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computing large planar regions in terrains, with an application to fracture surfaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exact and approximation algorithms for clustering / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maintenance of a minimum spanning forest in a dynamic plane graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a circle placement problem / rank | |||
Normal rank |
Revision as of 16:00, 10 June 2024
scientific article; zbMATH DE number 2210831
Language | Label | Description | Also known as |
---|---|---|---|
English | FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE |
scientific article; zbMATH DE number 2210831 |
Statements
FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE (English)
0 references
29 September 2005
0 references
triangulated irregular network
0 references