Computational Geometry: Theory and Applications

Aims & Scope

Computational Geometry is a forum for research in theoretical and applied aspects of computational geometry.

The journal publishes fundamental research in all areas of the subject, as well as disseminating information on the applications, techniques, and use of computational geometry.

Computational Geometry publishes articles on the design and analysis of geometric algorithms.

All aspects of computational geometry are covered, including the numerical, graph theoretical and combinatorial aspects.

Also welcomed are computational geometry solutions to fundamental problems arising in computer graphics, pattern recognition, robotics, image processing, CAD-CAM, VLSI design and geographical information systems.

Computational Geometry features a special section containing open problems and concise reports on implementations of computational geometry tools.

Metrics & Ranking

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• Delaunay refinement algorithms for triangular mesh generation

  Citation: 857

  Authors: Jonathan Richard

• Algorithms for drawing graphs: an annotated bibliography

  Citation: 480

  Authors: Giuseppe Di, Peter, Roberto, Ioannis G

• The power crust, unions of balls, and the medial axis transform

  Citation: 376

  Authors: Nina, Sunghee, Ravi Krishna

• Computing contour trees in all dimensions

  Citation: 322

  Authors: Hamish, Jack, Ulrike

• The point in polygon problem for arbitrary polygons

  Citation: 312

  Authors: Kai, Alexander

• A local search approximation algorithm for k-means clustering

  Citation: 253

  Authors: Tapas, David M., Nathan S., Christine D., Ruth, Angela Y.

• Unit disk graph recognition is NP-hard

  Citation: 201

  Authors: Heinz, David G.

• Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.

  Citation: 183

  Authors: Esther M., Sándor P., Joseph S.B.

• On a class of O(n2) problems in computational geometry

  Citation: 181

  Authors: Anka, Mark H

• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons

  Citation: 176

  Authors: Raimund