On finding an empty stair case polygon of largest area (width) in a planar point-set

Simple item page
dc.contributor.authorNandy, Subhas C
dc.contributor.authorBhattacharya, Bhargab B
dc.date.accessioned2012-11-12T05:55:08Z
dc.date.available2012-11-12T05:55:08Z
dc.date.issued2003-10
dc.identifier.citationComputational Geometry,v.26, no. 2, p. 143–171en_US
dc.identifier.urihttp://hdl.handle.net/10263/4770
dc.language.isoenen_US
dc.subjectGeometric graph theoryen_US
dc.subjectPermutation graphsen_US
dc.subjectAlgorithmsen_US
dc.subjectComplexityen_US
dc.titleOn finding an empty stair case polygon of largest area (width) in a planar point-seten_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
On finding an empty staircase polygon of largest area (width).pdf
Size:
1.59 MB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Mathematics and Statistics