On local transformations in plane geometric graphs embedded on small grids

Authors:
Manuel Abellanas;Prosenjit Bose;Alfredo García;Ferran Hurtado;Pedro Ramos;Eduardo Rivera-Campo;Javier Tejel
Affiliations:
Facultad de Informática, U. Politécnica de Madrid, Madrid, Spain;School of Computer Science, Carleton U., Ottawa, Canada;Fac. Ciencias, Dep. de Métodos Estadísticos, U. de Zaragoza, Zaragoza, Spain;Departament de Matemàtica Aplicada II, U. Politècnica de Catalunya, Barcelona, Spain;Dep. de Matemáticas, U. de Alcalá, Madrid, Spain;Dep. Matemáticas, U. Autónoma Metropolitana-Iztapalapa, México D.F., Mexico;Fac. Ciencias, Dep. de Métodos Estadísticos, U. de Zaragoza, Zaragoza, Spain
Venue:
Computational Geometry: Theory and Applications
Year:
2008

Citing 11
Cited 1

Diagonal flips in triangulations of surfaces

Discrete Mathematics
Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Diagonal flips of triangulations on closed surfaces preserving specified properties

Journal of Combinatorial Theory Series B
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Diagonal flips in triangulations on closed surfaces with minimum degree at least 4

Journal of Combinatorial Theory Series B
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Graph of triangulations of a convex polygon and tree of triangulations

Computational Geometry: Theory and Applications
Mental imagery in program design and visual programming

International Journal of Human-Computer Studies - Best of empirical studies of programmers 7
Diagonal flips in outer-torus triangulations

Discrete Mathematics
Diagonal flips in outer-Klein-bottle triangulations

Discrete Mathematics
Simultaneous diagonal flips in plane triangulations

Journal of Graph Theory

Flips in planar graphs

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of computing the visibility of a query point inside polygons with holes. The goal is to perform this computation efficiently per query considering the cost of the preprocessing phase. Our algorithm is based on solutions ...