Promote Sponsor
verified SJR 0,396 · Q3 • database Scopus / SJR & Web of Science indexed
Computational Geometry: Theory and Applications
Netherlands · Elsevier B.V.
workspace_premium Q3 — Computational Theory and Mathematics lock Subscription Unclaimed

Computational Geometry: Theory and Applications

Computational Geometry: Theory and Applications is a journal indexed in SJR in Computational Theory and Mathematics and Computer Science Applications with an H index of 61. It has an SJR impact factor of 0,396 and it has a best quartile of Q3. It is published in English. It has an SJR impact factor of 0,396.

ISSN: 0925-7721
Editorial: Elsevier B.V.
Category: Computational Theory and Mathematics
Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Portal NPD menu_book Guidelines NPD
schedule Datos CoP · solo campos en BD
SJR Impact Factor trending_up
0,396 Q3
H-index 61
Tasa de Aceptación pie_chart
29% Selectiva
Fuente Acceptance_Rate
Tiempo a publicación hourglass_top
NPD
Campo Sin dato
Coste de Publicación (APC) payments
NPD Subscription
Ruta Non-OA NPD

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

0,396

H-index

61

Docs (year)

33

Docs 3y

168

Total refs

891

Cites 3y

134

Citable 3y

161

Cites/Doc 2y

0.9

Ref/Doc

27.0

Immediate OA

—

Embargoed OA

NPD

Non OA / Submission

—

shield Researcher voice

Name good journals. Call out predatory ones.

Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims
rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.
User
* Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Box-trees for collision checking in industrial installations

View more

Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker

View more

Dynamic algorithms for geometric spanners of small diameter: Randomized solutions

View more

Design and analysis of planar shape deformation

View more

Densest translational lattice packing of non-convex polygons

View more

Convexity minimizes pseudo-triangulations

View more

Constructing convex 3-polytopes from two triangulations of a polygon

View more

Conforming Delaunay triangulations in 3D

View more

Computing Voronoi skeletons of a 3-D polyhedron by space subdivision

View more

Computing half-plane and strip discrepancy of planar point sets

View more

Computing fence designs for orienting parts

View more

Competitive searching in a generalized street

View more
SHOW MORE ARTICLES

Characterization of contour elements that generate abstract Voronoi diagrams

View more

3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

View more

Beta-skeletons have unbounded dilation

View more

Average case analysis of dynamic geometric optimization

View more

Art galleries with guards of uniform range of vision

View more

Area-efficient algorithms for straight-line tree drawings

View more

An elementary algorithm for reporting intersections of red/blue curve segments

View more

An approximation algorithm for cutting out convex polygons

View more

Algebraic methods and arithmetic filtering for exact predicates on circle arcs

View more

A note on parallel algorithms for optimal h-v drawings of binary trees

View more

A Helly-type theorem for higher-dimensional transversals

View more

A dense planar point set from iterated line intersections

View more

FAQS