scientific article
From MaRDI portal
Publication:3776623
zbMath0636.68048MaRDI QIDQ3776623
No author found.
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)
Related Items (15)
An algorithm for handling many relational calculus queries efficiently. ⋮ Generalized Delaunay triangulation for planar graphs ⋮ Voronoi diagrams over dynamic scenes ⋮ Some problems in computational geometry ⋮ Decomposition and intersection of simple splinegons ⋮ A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons ⋮ Voronoi diagrams with barriers and the shortest diagonal problem ⋮ Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems ⋮ Information storage and search complexity theory ⋮ Optimal time bounds for some proximity problems in the plane ⋮ How to determine the minimum number of fuzzy rules to achieve given accuracy: a computational geometric approach to SISO case ⋮ On heuristics for minimum length rectilinear partitions ⋮ Dynamic Trees and Dynamic Point Location ⋮ On convex partitions of polygonal regions ⋮ ENCRYPTION OF 3D PLANE IN GIS USING VORONOI-DELAUNAY TRIANGULATIONS AND CATALAN NUMBERS
This page was built for publication:
