Pages that link to "Item:Q1330785"
From MaRDI portal
The following pages link to Ray shooting in polygons using geodesic triangulations (Q1330785):
Displaying 22 items.
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction (Q4513199) (← links)
- GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON (Q4650081) (← links)
- MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS (Q4650087) (← links)
- k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON (Q4682198) (← links)
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS (Q4818544) (← links)
- AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT (Q4818547) (← links)
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS (Q4818554) (← links)
- COMPUTATIONAL GEOMETRY COLUMN 43 (Q4818560) (← links)
- Adaptive Planar Point Location (Q5009786) (← links)
- Global Curve Simplification (Q5075813) (← links)
- Partially Walking a Polygon (Q5091053) (← links)
- A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
- A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS (Q5247063) (← links)
- TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS (Q5261016) (← links)
- Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) (← links)
- Finding the shortest boundary guard of a simple polygon (Q5941506) (← links)
- Polygons cuttable by a circular saw (Q5952972) (← links)
- How to cut corners and get bounded convex curvature (Q6045790) (← links)
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons (Q6174809) (← links)
- k-pairs non-crossing shortest paths in a simple polygon (Q6487450) (← links)
- Uniformly monotone partitioning of polygons (Q6593668) (← links)
- Algorithms for subpath convex hull queries and ray-shooting among segments (Q6593765) (← links)
