Bold graph drawings (Q654288)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Bold graph drawings	scientific article

Statements

scholarly article

0 references

Bold graph drawings (English)

0 references

Computational Geometry

0 references

publication date

28 December 2011

0 references

zbMATH Keywords

graph drawing

0 references

edge and vertex size

0 references

planar straight-line drawing

0 references

Marc J. van Kreveld

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.comgeo.2011.06.002

0 references

0 references

Drawing Planar Graphs with Large Vertices and Thick Edges

0 references

An optimal algorithm for intersecting line segments in the plane

0 references

Applications of random sampling in computational geometry. II

0 references

DRAWING WITH FAT EDGES

0 references

New lower bounds for Hopcroft's problem

0 references

Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments

0 references

Every Graph Admits an Unambiguous Bold Drawing

0 references

An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.comgeo.2011.06.002

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:654288

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q654288&oldid=35260261"