International Journal of Computational Geometry and Applications

Aims & Scope

The International Journal of Computational Geometry & Applications (IJCGA) is a quarterly journal devoted to the field of computational geometry within the framework of design and analysis of algorithms.

Emphasis is placed on the computational aspects of geometric problems that arise in various fields of science and engineering including computer-aided geometry design (CAGD), computer graphics, constructive solid geometry (CSG), operations research, pattern recognition, robotics, solid modelling, VLSI routing/layout, and others.

Research contributions ranging from theoretical results in algorithm design — sequential or parallel, probabilistic or randomized algorithms — to applications in the above-mentioned areas are welcome.

Research findings or experiences in the implementations of geometric algorithms, such as numerical stability, and papers with a geometric flavour related to algorithms or the application areas of computational geometry are also welcome.

View Aims & Scope

---

Metrics & Ranking

Journal Rank

Year	Value
2024	25506

Journal Citation Indicator

Year	Value
2024	12

SJR (SCImago Journal Rank)

Year	Value
2024	0.138

Quartile

Year	Value
2024	Q4

h-index

Year	Value
2024	41

---

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.

• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES

  Citation: 754

  Authors: HELMUT, MICHAEL

• PATH PLANNING IN EXPANSIVE CONFIGURATION SPACES

  Citation: 214

  Authors: DAVID, JEAN-CLAUDE, RAJEEV

• A VISIBILITY-BASED PURSUIT-EVASION PROBLEM

  Citation: 205

  Authors: LEONIDAS J., JEAN-CLAUDE, STEVEN M., DAVID, RAJEEV

• ESTIMATING SURFACE NORMALS IN NOISY POINT CLOUD DATA

  Citation: 184

  Authors: NILOY J., AN, LEONIDAS

• N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS

  Citation: 167

  Authors: PASCAL

• A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM

  Citation: 158

  Authors: NARGESS, DAVID M., NATHAN S., JACQUELINE

• A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION

  Citation: 140

  Authors: NINA, SUNGHEE, TAMAL K., NAVEEN

• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR

  Citation: 93

  Authors: W.S., F.

• AUTOMATIC RECONSTRUCTION OF 3D CAD MODELS FROM DIGITAL SCANS

  Citation: 88

  Authors: FAUSTO, CHANDRAJIT L., JINDONG, DANIEL R.

• Triangulating Topological Spaces

  Citation: 86

  Authors: Herbert, Nimish R.

---