Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains - MaRDI portal

A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains

From MaRDI portal

Publication:5120154

Jump to:navigation, search

DOI10.20382/JOCG.V11I1A10zbMath1477.68499arXiv1903.01417OpenAlexW2919220605MaRDI QIDQ5120154

Haitao Wang

Publication date: 9 September 2020

Full work available at URL: https://arxiv.org/abs/1903.01417

Mathematics Subject Classification ID

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

This page was built for publication: A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5120154&oldid=19644217"