Pages that link to "Item:Q4188754"
From MaRDI portal
The following pages link to An Optimal Algorithm for Finding the Kernel of a Polygon (Q4188754):
Displaying 47 items.
- On \(k\)-convex polygons (Q427049) (← links)
- LR-visibility in polygons (Q676582) (← links)
- Linear-time algorithms for weakly-monotone polygons (Q685601) (← links)
- Diffuse reflection radius in a simple polygon (Q727965) (← links)
- Minimum vertex distance between separable convex polygons (Q789904) (← links)
- Computational geometry in a curved world (Q911324) (← links)
- Some chain visibility problems in a simple polygon (Q911765) (← links)
- Visibility between two edges of a simple polygon (Q1096432) (← links)
- Recognizing polygons, or how to spy (Q1104085) (← links)
- On geodesic properties of polygons relevant to linear time triangulation (Q1118350) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- On the number of guard edges of a polygon (Q1312196) (← links)
- Recognizing weakly convex visible polygons (Q1392848) (← links)
- Searching and on-line recognition of star-shaped polygons. (Q1427863) (← links)
- The traveling salesmanpProblem for lines in the plane (Q1603540) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- Applications of a two-dimensional hidden-line algorithm to other geometric problems (Q1838318) (← links)
- Staircase visibility and computation of kernels (Q1894710) (← links)
- A linear-time algorithm for constructing a circular visibility diagram (Q1897474) (← links)
- \(\alpha\)-kernel problem with fuzzy visibility (Q1920271) (← links)
- Arc fibrations of planar domains (Q2010279) (← links)
- Representing planar domains by polar parameterizations with parabolic parameter lines (Q2020347) (← links)
- Optimizing generalized kernels of polygons (Q2046316) (← links)
- Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints (Q2127702) (← links)
- Starshaped sets (Q2216442) (← links)
- Minimal link visibility paths inside a simple polygon (Q2367125) (← links)
- Approximate guarding of monotone and rectilinear polygons (Q2375947) (← links)
- Guarding orthogonal art galleries with sliding cameras (Q2401332) (← links)
- On circularly-hidden surface removal. (Q2583547) (← links)
- Multiple point visibility and related problems (Q2710754) (← links)
- High-quality surface remeshing using harmonic maps (Q3164495) (← links)
- A new triangulation-linear class of simple polygons (Q3804191) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- TURNING SHAPE DECISION PROBLEMS INTO MEASURES (Q4669615) (← links)
- SEARCHING A POLYGONAL REGION FROM THE BOUNDARY (Q4682159) (← links)
- SUCCESSIVE MAPPINGS: AN APPROACH TO POLYGONAL MESH SIMPLIFICATION WITH GUARANTEED ERROR BOUNDS (Q4818542) (← links)
- OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS (Q4818564) (← links)
- PLANAR STRONG VISIBILITY (Q4818579) (← links)
- Open Guard Edges and Edge Guards in Simple Polygons (Q4899264) (← links)
- An O(log log n) algorithm to compute the kernel of a polygon (Q5054771) (← links)
- Finding all weakly-visible chords of a polygon in linear time (Q5056171) (← links)
- Line-of-Sight Pursuit in Monotone and Scallop Polygons (Q5149564) (← links)
- GUARDING ART GALLERIES BY GUARDING WITNESSES (Q5470173) (← links)
- Finding the shortest boundary guard of a simple polygon (Q5941506) (← links)
- Kernel-based construction operators for Boolean sum and ruled geometry (Q6170343) (← links)
- (Q6179337) (← links)
