Pages that link to "Item:Q1816465"
From MaRDI portal
The following pages link to Topologically sweeping visibility complexes via pseudotriangulations (Q1816465):
Displaying 33 items.
- The brick polytope of a sorting network (Q412257) (← links)
- Multitriangulations, pseudotriangulations and primitive sorting networks (Q443914) (← links)
- Spiderman graph: visibility in urban regions (Q482349) (← links)
- Convexity minimizes pseudo-triangulations (Q598549) (← links)
- The stochastic walk algorithms for point location in pseudo-triangulations (Q634299) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- Pointed binary encompassing trees: simple and optimal (Q733553) (← links)
- Empty pseudo-triangles in point sets (Q765318) (← links)
- Combinatorial pseudo-triangulations (Q864146) (← links)
- Alternating paths along axis-parallel segments (Q882782) (← links)
- Decomposing a simple polygon into pseudo-triangles and convex polygons (Q934018) (← links)
- Segment endpoint visibility graphs are Hamiltonian (Q1395575) (← links)
- Kinetic collision detection between two simple polygons. (Q1428461) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- Enumerating pseudo-triangulations in the plane (Q1776895) (← links)
- Tight degree bounds for pseudo-triangulations of points (Q1873151) (← links)
- Minimal tangent visibility graphs (Q1924714) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
- Quickest visibility queries in polygonal domains (Q2316797) (← links)
- Brick polytopes of spherical subword complexes and generalized associahedra (Q2344829) (← links)
- On planar path transformation (Q2379998) (← links)
- Minimum weight pseudo-triangulations (Q2385693) (← links)
- Transforming pseudo-triangulations (Q2390240) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- Pre-triangulations and liftable complexes (Q2471725) (← links)
- On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS (Q4818577) (← links)
- On geometric path query problems (Q5096943) (← links)
- A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
- LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS (Q5300001) (← links)
- ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX (Q5386746) (← links)
- Celebrating Loday's associahedron (Q6139351) (← links)
