ISSN: 0218-1959

Journal Home

Journal Guideline

International Journal of Computational Geometry and Applications Q4 Unclaimed

World Scientific Singapore

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

International Journal of Computational Geometry and Applications is a journal indexed in SJR in Applied Mathematics and Computational Theory and Mathematics with an H index of 40. It has a price of 2480 €. It has an SJR impact factor of 0,163 and it has a best quartile of Q4. It is published in English. It has an SJR impact factor of 0,163.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Applied Mathematics (Q4) Computational Mathematics (Q4) Computational Theory and Mathematics (Q4) Geometry and Topology (Q4) Theoretical Computer Science (Q4)

Price

2480 €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

International Journal of Computational Geometry and Applications

0,163

SJR Impact factor

40

H Index

10

Total Docs (Last Year)

28

Total Docs (3 years)

149

Total Refs

18

Total Cites (3 years)

28

Citable Docs (3 years)

0.35

Cites/Doc (2 years)

14.9

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

Monte Carlo Methods and Applications Q4
Applications of Mathematics Q4
Measurement Techniques Q4
IfCoLoG Journal of Logics and their Applications Q4
Journal of Contemporary Mathematical Analysis Q4

Compare this journals

Aims and Scope

Best articles by citations

A GRAPH DRAWING AND TRANSLATION SERVICE ON THE WORLD WIDE WEB

Parallelizing an Algorithm for Visibility on Polyhedral Terrain

LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS

Efficient Bitmap Resemblance Under Translations

Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model

Computing a Largest Empty Anchored Cylinder, and Related Problems

EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING

COMPUTING AN ALMOST MINIMUM SET OF SPANNING LINE SEGMENTS OF A POLYHEDRON

POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD

HOMEOMORPHISM OF 2-COMPLEXES IS EQUIVALENT TO GRAPH ISOMORPHISM

COMPUTING CLOSEST POINTS FOR SEGMENTS

Separating Translates in the Plane: Combinatorial Bounds and an Algorithm

SHOW MORE ARTICLES

CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS

Two Algorithms for the Sum of Diameters Problem and a Related Problem

TESTING THE CONGRUENCE OF d-DIMENSIONAL POINT SETS

EDITOR'S FOREWORD

MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION

Sparse Arrangements and the Number of Views of Polyhedral Scenes

SYMMETRY OF FLOW DIAGRAMS DERIVED FROM WEIGHTED POINTS IN THE PLANE

The Rectangle Enclosure and Point-Dominance Problems Revisited

POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION

VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME

CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES

Editor's Foreword