English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons

Oh, E. (2019). Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 391-409). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975482.25.

Item is

Basic

show hide
Genre: Conference Paper
Latex : Optimal Algorithm for Geodesic Nearest-point {V}oronoi Diagrams in Simple Polygons

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Oh, Eunjin1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 201820192019
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Oh_SODA19d
DOI: 10.1137/1.9781611975482.25
 Degree: -

Event

show
hide
Title: 30th Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: San Diego, CA, USA
Start-/End Date: 2019-01-06 - 2019-01-09

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2019
Source Genre: Proceedings
 Creator(s):
Chan, Timothy M.1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 391 - 409 Identifier: ISBN: 978-1-61197-548-2