Subdivision Drawings of Hypergraphs

DOI10.1007/978-3-642-00219-9_39MaRDI QIDQ3611876zbMATH OpenOpenAlexWikidataFDO

Authors Michael Kaufmann, Bettina Speckmann, Marc Van Kreveld

Publication date 3 March 2009

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00219-9_39

Mathematics Subject Classification ID

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

Recommendations

• Twins in Subdivision Drawings of Hypergraphs
• scientific article; zbMATH DE number 3959478
• Hypergraph planarity and the complexity of drawing venn diagrams
• How to draw a hypergraph
• A new drawing for simple Venn diagrams based on algebraic construction

Cites work

• Degrees of acyclicity for hypergraphs and relational database schemes
• Diagrammatic Representation and Inference
• How to draw a hypergraph
• scientific article; zbMATH DE number 4149959 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• scientific article; zbMATH DE number 2080095 (Why is no real title available?)
• scientific article; zbMATH DE number 2086735 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Hypergraph planarity and the complexity of drawing venn diagrams
• Hypermaps versus bipartite maps
• Orthogonal Hypergraph Drawing for Improved Visibility
• Overlapping Cluster Planarity
• Realizability of Delaunay triangulations
• Spherical Venn diagrams with involutory isometries

Cited in

(20)

• Generating hinges from arbitrary subhypergraphs
• Subdivisions in planar graphs
• Colored spanning graphs for set visualization
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• On transversal numbers of intersecting straight line systems and intersecting segment systems
• Twins in Subdivision Drawings of Hypergraphs
• Faster algorithms for the minimum red-blue-purple spanning graph problem
• Path-based supports for hypergraphs
• Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
• scientific article; zbMATH DE number 3959478 (Why is no real title available?)
• scientific article; zbMATH DE number 4033797 (Why is no real title available?)
• Path-based supports for hypergraphs
• The painter's problem: covering a grid with colored connected polygons
• CHROMATIC POLYNOMIAL OF SEMI-UNIFORM HYPERSTAR
• On intersecting straight line systems
• Trinque problem: covering complete graphs by plane degree-bounded hypergraphs
• On transversal and 2-packing numbers in uniform linear systems
• Decomposing the feasibility of clustered spanning tree by paths
• The role of twins in computing planar supports of hypergraphs
• Using the metro-map metaphor for drawing hypergraphs

This page was built for publication: Subdivision Drawings of Hypergraphs

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