Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the Farthest Line-Segment Voronoi Diagram

From MaRDI portal
Publication:4909535
Jump to:navigation, search

DOI10.1007/978-3-642-35261-4_22zbMath1260.68421OpenAlexW1862650283MaRDI QIDQ4909535

Sandeep Kumar Dey, Evanthia Papadopoulou

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_22



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)


Related Items (1)

Map of Geometric Minimal Cuts for General Planar Embedding




This page was built for publication: On the Farthest Line-Segment Voronoi Diagram

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4909535&oldid=19300674"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 07:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki