Aspect-ratio Voronoi diagram and its complexity bounds

DOI10.1016/J.IPL.2007.07.010zbMATH Open1184.68554OpenAlexW2081243291MaRDI QIDQ2380035FDOQ2380035

Authors: Tetsuo Asano 

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.07.010

Recommendations

• scientific article; zbMATH DE number 4051001
• Voronoi diagrams with respect to criteria on vision information
• An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (extended abstract)
• The higher-order Voronoi diagram of line segments
• An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments

zbMATH Keywords

algorithmscomputational geometrycombinatorial problems

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Upper and lower bounds for the Voronoi-Minkowski constant
• Voronoi diagrams with respect to criteria on vision information
• Comparing perfect and 2nd Voronoi decompositions: the matroidal locus

This page was built for publication: Aspect-ratio Voronoi diagram and its complexity bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380035)