Maintenance of configurations in the plane
From MaRDI portal
Publication:1158972
DOI10.1016/0022-0000(81)90012-XzbMath0474.68082MaRDI QIDQ1158972
Jan van Leeuwen, Mark H. Overmars
Publication date: 1981
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68R99: Discrete mathematics in relation to computer science
68W99: Algorithms in computer science
Related Items
Determining Weak Visibility of a Polygon from an Edge in Parallel, COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME, OPTIMAL LINE BIPARTITIONS OF POINT SETS, Output-sensitive peeling of convex and maximal layers, Perfect binary space partitions, Computational geometry algorithms for the systolic screen, A new data structure for shortest path queries in a simple polygon, On the dynamic maintenance of maximal points in the plane, Off-line dynamic maintenance of the width of a planar point set, Applications of a semi-dynamic convex hull algorithm, Special subgraphs of weighted visibility graphs, Parallel methods for visibility and shortest-path problems in simple polygons, On some geometric selection and optimization problems via sorted matrices, Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time, Median hyperplanes in normed spaces -- a survey, Parallel solutions to geometric problems in the scan model of computation, Ray shooting in polygons using geodesic triangulations, Dynamic Euclidean minimum spanning trees and extrema of binary functions, An introduction to randomization in computational geometry, An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains, Output-sensitive results on convex hulls, extreme points, and related problems, Dynamic half-space range reporting and its applications, On geometric optimization with few violated constraints
