Reconstructing Generalized Staircase Polygons with Uniform Step Length

DOI10.1007/978-3-319-73915-1_8zbMath1503.68235arXiv1708.09842OpenAlexW2751569073MaRDI QIDQ4625103

Darren Strash, Nodari Sitchinava

Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.09842

zbMATH Keywords

fixed-parameter tractabilityorthogonal polygonspolygon reconstructionvisibility graphsvisibility graph recognition

Mathematics Subject Classification ID

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

Related Items (1)

Reconstructing Generalized Staircase Polygons with Uniform Step Length

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orthogonal polygon reconstruction from stabbing information
• Characterizing and recognizing the visibility graph of a funnel-shaped polygon
• Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
• On characterizing terrain visibility graphs
• Number-theoretic constructions of efficient pseudo-random functions
• Efficient and secure authenticated key exchange using weak passwords
• Recognizing visibility graphs of spiral polygons
• Reconstructing Generalized Staircase Polygons with Uniform Step Length
• VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
• Graph isomorphism in quasipolynomial time [extended abstract]
• Theory of Cryptography

This page was built for publication: Reconstructing Generalized Staircase Polygons with Uniform Step Length