Visibility and intersection problems in plane geometry
From MaRDI portal
(Redirected from Publication:910213)
Recommendations
- Non-Euclidean visibility problems
- scientific article; zbMATH DE number 5542506
- Visibility graphs of point sets in the plane
- Visibility graphs of point sets in the plane
- scientific article; zbMATH DE number 16594
- scientific article; zbMATH DE number 4078149
- Visibility Algorithms in the Plane
- Visibility in semi-convex spaces
- Computing the visibility polygon from a convex set and related problems
- scientific article; zbMATH DE number 2087475
Cites work
- An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
- Computing on a free tree via complexity-preserving mappings
- Design and implementation of an efficient priority queue
- Filtering Search: A New Approach to Query-Answering
- Fractional cascading. I: A data structuring technique
- Fractional cascading. II: Applications
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Optimal Point Location in a Monotone Subdivision
- Optimal shortest path queries in a simple polygon
Cited in
(90)- An improved technique for output-sensitive hidden surface removal
- The furthest-site geodesic Voronoi diagram
- Dynamic Trees and Dynamic Point Location
- Locating two obnoxious facilities using the weighted maximin criterion
- Efficient visibility queries in simple polygons
- An algorithm for generalized point location and its applications
- Storing line segments in partition trees
- Ray shooting and stone throwing with near-linear storage
- The visibility diagram: A data structure for visibility problems and motion planning
- Computing instance-optimal kernels in two dimensions
- Optimum sweeps of simple polygons with two guards
- Minimization of the maximum distance between the two guards patrolling a polygonal region
- Approximation algorithms for decomposing octilinear polygons
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- scientific article; zbMATH DE number 5490684 (Why is no real title available?)
- Computing optimal shortcuts for networks
- Parallel methods for visibility and shortest-path problems in simple polygons
- Computing common tangents without a separating line
- A unified and efficient solution to the room search problem
- Efficient ray shooting and hidden surface removal
- Decomposing the boundary of a nonconvex polyhedron
- Query point visibility computation in polygons with holes
- Algorithmic enumeration of surrounding polygons
- Tracing compressed curves in triangulated surfaces
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Visibility and ray shooting queries in polygonal domains
- Shortcut sets for the locus of plane Euclidean networks
- Computing simple paths from given points inside a polygon
- Computing depth orders for fat objects and related problems
- OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
- Maintaining visibility of a polygon with a moving point of view
- Finding all door locations that make a room searchable
- Weak visibility counting in simple polygons
- Algorithms for subpath convex hull queries and ray-shooting among segments
- Applications of a new space-partitioning technique
- Implicitly representing arrangements of lines or segments
- An optimal algorithm to compute the inverse beacon attraction region
- Processing an offline insertion-query sequence with applications
- On range searching with semialgebraic sets
- Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles
- An efficient algorithm for the three-guard problem
- Triangulating a simple polygon in linear time
- A unifying approach for a class of problems in the computational geometry of polygons
- Line segment visibility with sidedness constraints
- An O\((n\log n)\) algorithm for the zoo-keeper's problem
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- Ray shooting in polygons using geodesic triangulations
- Graphics in flatland revisited
- Computing the link center of a simple polygon
- Separating two simple polygons by a sequence of translations
- Quasi-optimal range searching in spaces of finite VC-dimension
- On the general motion-planning problem with two degrees of freedom
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Generalized hidden surface removal
- Can visibility graphs be represented compactly?
- Computing depth orders and related problems
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- The geodesic edge center of a simple polygon
- Near optimal line segment queries in simple polygons
- On the minimality of polygon triangulation
- Upper envelope onion peeling
- Local minima for indefinite quadratic knapsack problems
- Guarding a terrain by two watchtowers
- Distance measures on intersecting objects and their applications
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
- Efficient algorithms for touring a sequence of convex polygons and related problems
- Processing an Offline Insertion-Query Sequence with Applications
- An optimal algorithm for the boundary of a cell in a union of rays
- Some chain visibility problems in a simple polygon
- Approximation algorithms for the watchman route and zookeeper's problems.
- Non-Euclidean visibility problems
- Searching for mobile intruders in circular corridors by two 1-searchers
- Algorithms for halfplane coverage and related problems
- Special subgraphs of weighted visibility graphs
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
- An optimal visibility graph algorithm for triangulated simple polygons
- Intersection queries in sets of disks
- Simplex Range Searching and Its Variants: A Review
- Shortcut sets for plane Euclidean networks (extended abstract)
- Computing the visibility polygon of an island in a polygonal domain
- A linear-time algorithm for constructing a circular visibility diagram
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- Incremental algorithms to update visibility polygons
- Fractional cascading. II: Applications
- Polygons cuttable by a circular saw
- Dynamic algorithms for visibility polygons in simple polygons
- A note on the combinatorial structure of the visibility graph in simple polygons
- Decomposing the boundary of a nonconvex polyhedron
- LR-visibility in polygons
This page was built for publication: Visibility and intersection problems in plane geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910213)
