| dc.contributor.author | Shekhawat, Krishnendra | |
| dc.date.accessioned | 2023-08-10T10:10:57Z | |
| dc.date.available | 2023-08-10T10:10:57Z | |
| dc.date.issued | 2022 | |
| dc.identifier.uri | http://comb-opt.azaruniv.ac.ir/article_14427.html | |
| dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11293 | |
| dc.description.abstract | This paper focuses on a novel approach for producing a floor plan (FP), either a rectangular (RFP) or an orthogonal (OFP) based on the concept of orthogonal drawings, which satisfies the adjacency relations given by any bi-connected plane triangulation G. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | ASMU | en_US |
| dc.subject | Mathematics | en_US |
| dc.subject | Orthogonal floor plan | en_US |
| dc.subject | Plane triangulation | en_US |
| dc.subject | Orthogonal drawing | en_US |
| dc.subject | Triconnected plane graph | en_US |
| dc.subject | Algorithm | en_US |
| dc.title | Linear-time construction of floor plans for plane triangulations | en_US |
| dc.type | Article | en_US |
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||