Farthest line segment Voronoi diagrams (Q845871)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Farthest line segment Voronoi diagrams	scientific article

Statements

scholarly article

0 references

Farthest line segment Voronoi diagrams (English)

0 references

Information Processing Letters

0 references

publication date

29 January 2010

0 references

zbMATH Keywords

computational geometry

0 references

Voronoi diagram

0 references

farthest line segment

0 references

optimal algorithm

0 references

Franz Aurenhammer

0 references

Robert L. Scot Drysdale

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ipl.2006.07.008

0 references

A linear-time algorithm for computing the Voronoi diagram of a convex polygon

0 references

An optimal algorithm for constructing the weighted Voronoi diagram in the plane

0 references

0 references

2-point site Voronoi diagrams

0 references

Proximity problems on line segments spanned by points

0 references

An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points

0 references

Stabbing line segments

0 references

A sweepline algorithm for Voronoi diagrams

0 references

Generalization of Voronoi Diagrams in the Plane

0 references

Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications

0 references

On the all-farthest-segments problem for a planar set of points

0 references

0 references

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

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.IPL.2006.07.008

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:845871

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