Pages that link to "Item:Q809630"
From MaRDI portal
The following pages link to A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q809630):
Displaying 36 items.
- Computing a single cell in the overlay of two simple polygons (Q287185) (← links)
- Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
- On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain (Q433075) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Four results on randomized incremental constructions (Q686138) (← links)
- Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection (Q686143) (← links)
- Complete and robust no-fit polygon generation for the irregular stock cutting problem (Q858412) (← links)
- A practical algorithm for decomposing polygonal domains into convex polygons by diagonals (Q1001364) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- Walking an unknown street with bounded detour (Q1194307) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- An introduction to randomization in computational geometry (Q1351693) (← links)
- A fast algorithm for approximating the detour of a polygonal chain. (Q1428113) (← links)
- Finding exact solutions for the geometric firefighter problem in practice (Q1652708) (← links)
- Solving the geometric firefighter routing problem via integer programming (Q1755409) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Expected asymptotically optimal planar point location (Q1883578) (← links)
- On-line construction of the upper envelope of triangles and surface patches in three dimensions (Q1917040) (← links)
- Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- Coupling of BEM with a large displacement and rotation algorithm (Q2855286) (← links)
- FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT (Q2875646) (← links)
- Abstract Voronoi Diagrams from Closed Bisecting Curves (Q3132921) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- Efficient and Qualified Mesh Generation for Gaussian Molecular Surface Using Adaptive Partition and Piecewise Polynomial Approximation (Q4637667) (← links)
- EXACT GEOMETRIC COMPUTATION USING CASCADING (Q4682167) (← links)
- Analysis of single rock blocks for general failure modes under conservative and non-conservative forces (Q4933177) (← links)
- (Q5009355) (← links)
- (Q5009629) (← links)
- Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
- A unified approach to tail estimates for randomized incremental construction (Q5088886) (← links)
- Four results on randomized incremental constructions (Q5096803) (← links)
- Enhanced Modified-Polygon Method for Point-in-Polygon Problem (Q5141345) (← links)
- ABSTRACT VORONOI DIAGRAMS WITH DISCONNECTED REGIONS (Q5261019) (← links)
- Adaptive Point Location in Planar Convex Subdivisions (Q5370568) (← links)
- Markov incremental constructions (Q5896960) (← links)
