Fast skeleton construction (Q6102331)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7683224

Language	Label	Description	Also known as
English	Fast skeleton construction	scientific article; zbMATH DE number 7683224

Statements

scholarly article

0 references

Fast skeleton construction (English)

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

8 May 2023

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-60313-1_172

0 references

Triangulating a simple polygon in linear time

0 references

Four results on randomized incremental constructions

0 references

RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS

0 references

0 references

Finding the convex hull of a simple polygon

0 references

On the computational geometry of pocket machining

0 references

Randomized incremental construction of abstract Voronoi diagrams

0 references

On finding the convex hull of a simple polygon

0 references

Generalized Delaunay triangulation for planar graphs

0 references

Voronoi diagrams with barriers and the shortest diagonal problem

0 references

Continuous Skeletons from Digitized Images

0 references

0 references

0 references

0 references

An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/3-540-60313-1_172

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6102331

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6102331&oldid=37514212"