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

Widest empty L-shaped corridor

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

DOI10.1016/0020-0190(96)00070-1zbMath0900.68423OpenAlexW1970154420MaRDI QIDQ671259

Siu-Wing Cheng

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00070-1


zbMATH Keywords

AlgorithmsComputational geometryPersistent search tree


Mathematics Subject Classification ID

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


Related Items (11)

On finding a widest empty 1-corner corridor ⋮ LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS ⋮ On finding widest empty curved corridors ⋮ THE LARGEST EMPTY ANNULUS PROBLEM ⋮ Recognition of largest empty orthoconvex polygon in a point set ⋮ On finding an empty staircase polygon of largest area (width) in a planar point-set ⋮ Locating an obnoxious plane ⋮ Improved algorithm for the widest empty 1-corner corridor ⋮ Improved Algorithm for a Widest 1-Corner Corridor ⋮ Maximum-width empty square and rectangular annulus ⋮ Computing obnoxious 1-corner polygonal chains



Cites Work

  • The K-dense corridor problems




This page was built for publication: Widest empty L-shaped corridor

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