A Compact Encoding of Rectangular Drawings with Efficient Query Supports

DOI10.1007/978-3-540-72870-2_7MaRDI QIDQ5434424zbMATH OpenOpenAlexFDO

Authors Katsuhisa Yamanaka, Shin-Ichi Nakano

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72870-2_7

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1974118
• scientific article; zbMATH DE number 1974124
• Rectangular drawings of planar graphs
• A (4n − 4)-Bit Representation of a Rectangular Drawing or Floorplan
• A compact encoding of plane triangulations with efficient query supports

Cited in

(3)

• A simple optimal binary representation of mosaic floorplans and Baxter permutations
• scientific article; zbMATH DE number 1974118 (Why is no real title available?)
• A (4n − 4)-Bit Representation of a Rectangular Drawing or Floorplan

This page was built for publication: A Compact Encoding of Rectangular Drawings with Efficient Query Supports

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434424)