scientific article; zbMATH DE number 4065813
From MaRDI portal
Publication:3799261
decompositioncomputational geometrytriangulationpolygonsmonotonestar-shapedspiralvisibility graphsart gallery theoremsconvex partitioning algorithms
Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Polyhedra and polytopes; regular figures, division of spaces (51M20) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Other problems of combinatorial convexity (52A37) Designs and configurations (05B99)
Recommendations
Cited in
(only showing first 100 items - show all)- Partial domination of maximal outerplanar graphs
- Approximating constrained tetrahedrizations
- Searching for mobile intruders in circular corridors by two 1-searchers
- Illumination by floodlights
- Protecting convex sets
- Radial drawings of graphs: geometric constraints and trade-offs
- scientific article; zbMATH DE number 4128383 (Why is no real title available?)
- On local transformation of polygons with visibility properties.
- Approximating maximum edge 2-coloring in simple graphs via local improvement
- Algorithms for the decomposition of a polygon into convex polygons
- Finding the \(\Theta \)-guarded region
- Computational complexity of art gallery problems
- scientific article; zbMATH DE number 3520315 (Why is no real title available?)
- Two-floodlight illumination of convex polygons
- On covering orthogonal polygons with star-shaped polygons
- Searching a polygonal region by a group of stationary \(k\)-searchers
- Some discrete geometric structures and associated algorithms
- The searchlight problem for road networks
- The robber route problem
- Minimum k-partitioning of rectilinear polygons
- Guarding curvilinear art galleries with vertex or point guards
- Solving the natural wireless localization problem to optimality efficiently
- Total dominating sets in maximal outerplanar graphs
- An O\((n\log n)\) algorithm for the zoo-keeper's problem
- A note on the combinatorial structure of the visibility graph in simple polygons
- Approximation algorithms for terrain guarding.
- Edge guarding polyhedral terrains
- Visibility graphs of towers
- All triangulations are reachable via sequences of edge-flips: an elementary proof
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- Obstacle numbers of graphs
- Facets for art gallery problems
- Extension to Even Triangulations
- A note on the contractions for orthogonal polygons
- scientific article; zbMATH DE number 2163102 (Why is no real title available?)
- scientific article; zbMATH DE number 6729378 (Why is no real title available?)
- Convex dominating sets in maximal outerplanar graphs
- Minimal link visibility paths inside a simple polygon
- Minimizing visible edges in polyhedra
- Path optimization with limited sensing ability
- Floodlight illumination of infinite wedges
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- A bound on a convexity measure for point sets
- Approximation algorithms for decomposing octilinear polygons
- Disjoint compatible geometric matchings
- Note on an art gallery problem
- Compatible geometric matchings
- Maximizing the guarded boundary of an Art Gallery is APX-complete
- An improved approximation algorithm for maximum edge 2-coloring in simple graphs
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Optimally computing a shortest weakly visible line segment inside a simple polygon
- Illumination in the presence of opaque line segments in the plane
- Guarding disjoint triangles and claws in the plane
- Parameter analysis for guarding terrains
- Triangulations, visibility graph and reflex vertices of a simple polygon
- Online searching with an autonomous robot
- A theory of spherical diagrams
- On partitioning rectilinear polygons into star-shaped polygons
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
- Guarding rectangular art galleries
- Covering grids and orthogonal polygons with periscope guards
- Rectangle-visibility representations of bipartite graphs
- Isolation number of maximal outerplanar graphs
- Optimal movement of mobile sensors for barrier coverage of a planar region
- Optimum watchman routes
- Approximation algorithms for art gallery problems in polygons
- Covering orthogonal polygons with star polygons: The perfect graph approach
- Efficient visibility queries in simple polygons
- Guarding in a simple polygon
- Watchman routes under limited visibility
- Experimental study on approximation algorithms for guarding sets of line segments
- Perfect graphs and guarding rectilinear art galleries
- A nearly optimal algorithm for covering the interior of an art gallery
- Geometric classification of triangulations and their enumeration in a convex polygon
- Guarding polyhedral terrains
- Camera placement in integer lattices
- Efficient piecewise-linear function approximation using the uniform metric
- Shortest watchman routes in simple polygons
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- Area requirement of visibility representations of trees
- Pentagonal chains and annuli as models for designing nanostructures from cages
- On visibility and covering by convex sets
- Monitoring maximal outerplanar graphs
- Finding the largest area axis-parallel rectangle in a polygon
- Approximating maximum edge 2-coloring in simple graphs
- Edge guards in rectilinear polygons
- Randomized query processing in robot path planning
- The partial visibility curve of the Feigenbaum cascade to chaos
- Visibility with multiple diffuse reflections
- Proper interval graphs and the guard problem
- A nearly optimal sensor placement algorithm for boundary coverage
- Guarding galleries and terrains
- Packing \([1, \Delta ]\)-factors in graphs of small degree
- Triangulating a simple polygon in linear time
- Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
- Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
- Generalized guarding and partitioning for rectilinear polygons
- Computing a shortest watchman path in a simple polygon in polynomial-time
- Guarding a Polygon Without Losing Touch
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799261)
