Minimal tangent visibility graphs (Q1924714)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Minimal tangent visibility graphs	scientific article

Statements

scholarly article

0 references

Minimal tangent visibility graphs (English)

0 references

Computational Geometry

0 references

publication date

20 October 1996

0 references

zbMATH Keywords

relative convex hulls

0 references

Davenport-Schinzel sequences

0 references

visibility graphs

0 references

Michel Pocchiola

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Visibility of disjoint polygons

0 references

Minimal visibility graphs

0 references

0 references

Topologically sweeping an arrangement

0 references

An Output-Sensitive Algorithm for Computing Visibility Graphs

0 references

0 references

Rotation and Winding Numbers for Planar Polygons and Curves

0 references

Theory of Maps on Orientable Surfaces

0 references

COMPUTATIONAL GEOMETRY COLUMN 18

0 references

Topologically sweeping visibility complexes via pseudotriangulations

0 references

Shortest paths in the plane with convex polygonal obstacles

0 references

Time and space efficient algorithms for shortest paths between convex polygons

0 references

A tight lower bound on the size of visibility graphs

0 references

A note on minimal visibility graphs

0 references

A fast algorithm for computing sparse visibility graphs

0 references

Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0925-7721(95)00016-X

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1924714

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