scientific article
From MaRDI portal
Publication:3776623
zbMATH Open0636.68048MaRDI QIDQ3776623
Author name not available (Why is that?)
Publication date: 1987
Title of this publication is not available (Why is that?)
Could not fetch data.
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)
Related Items (21)
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 ⋮ Discrete and computational geometry. The Goodman-Pollack Festschrift ⋮ Title not available (Why is that?) ⋮ Information storage and search complexity theory ⋮ Optimal time bounds for some proximity problems in the plane ⋮ New trends in discrete and computational geometry ⋮ Minimum convex partition of a polygon with holes by cuts in given directions ⋮ How to determine the minimum number of fuzzy rules to achieve given accuracy: a computational geometric approach to SISO case ⋮ Editorial ⋮ On heuristics for minimum length rectilinear partitions ⋮ Special issue on Applied computational geometry ⋮ 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3776623)
