Pages that link to "Item:Q1158972"
From MaRDI portal
The following pages link to Maintenance of configurations in the plane (Q1158972):
Displayed 50 items.
- An introduction to randomization in computational geometry (Q1351693) (← links)
- Indexing moving points (Q1394801) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- An optimal algorithm for plane matchings in multipartite geometric graphs (Q1616235) (← links)
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- Enumerating pseudo-triangulations in the plane (Q1776895) (← links)
- An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains (Q1804963) (← links)
- Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
- Optimal shortest path queries in a simple polygon (Q1823689) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- On embedding an outer-planar graph in a point set (Q1862133) (← links)
- Center problems with pos/neg weights on trees (Q1869485) (← links)
- Tight degree bounds for pseudo-triangulations of points (Q1873151) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- Recursion and parallel algorithms in geometric modeling problems (Q1956990) (← links)
- Cutting bamboo down to size (Q2078615) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Maintaining AUC and \(H\)-measure over time (Q2102344) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- The maximum-level vertex in an arrangement of lines (Q2117347) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Covering a simple polygon by monotone directions (Q2269836) (← links)
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- Applications of mathematics to maritime search (Q2321650) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Algorithms for Problems on Maximum Density Segment (Q2795931) (← links)
- Covering Points with Convex Sets of Minimum Size (Q2803821) (← links)
- Dynamic Planar Range Maxima Queries (Q3012811) (← links)
- An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs (Q3449806) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME (Q4513231) (← links)
- OPTIMAL LINE BIPARTITIONS OF POINT SETS (Q4513232) (← links)
- Efficient splitting and merging algorithms for order decomposable problems (Q4571990) (← links)
- AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE (Q4661880) (← links)
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS (Q4682161) (← links)
- k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON (Q4682198) (← links)
- COMPUTING CLOSEST POINTS FOR SEGMENTS (Q4818603) (← links)
- Constrained square-center problems (Q5054846) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q5056119) (← links)
- The two-line center problem from a polar view: a new algorithm and data structure (Q5057418) (← links)
- On some geometric selection and optimization problems via sorted matrices (Q5057419) (← links)
- Computing common tangents without a separating line (Q5057432) (← links)
- (Q5088951) (← links)
- (Q5088955) (← links)
- (Q5091039) (← links)
- Minimizing Distance-to-Sight in Polygonal Domains (Q5091052) (← links)
- A simplified technique for hidden-line elimination in terrains (Q5096777) (← links)
- Cartographic line simplication and polygon CSG formulae in O(n log* n) time (Q5096928) (← links)