Pages that link to "Item:Q1158972"
From MaRDI portal
The following pages link to Maintenance of configurations in the plane (Q1158972):
Displayed 35 items.
- Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
- Parallel solutions to geometric problems in the scan model of computation (Q1318471) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- An introduction to randomization in computational geometry (Q1351693) (← links)
- Indexing moving points (Q1394801) (← links)
- Efficient searching with linear constraints (Q1591152) (← 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)
- Covering a simple polygon by monotone directions (Q2269836) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Dynamic Planar Range Maxima Queries (Q3012811) (← 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)
- 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)
- Divide and Conquer Method for k-Set Polygons (Q5302751) (← links)
- ON THE LOCAL PROPERTIES OF DIGITAL CURVES (Q5305544) (← links)
- MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT (Q5386741) (← links)
- Compressing Spatio-temporal Trajectories (Q5387810) (← links)
- A consistent semantics of self-adjusting computation (Q5398334) (← links)
- Weighted Rectilinear Approximation of Points in the Plane (Q5458566) (← links)
- Tangential Cover for Thick Digital Curves (Q5458903) (← links)