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.
Unclaimed profile — some fields may be incomplete.
Metrics
Campos Scimago / CoP — sin series inventadas
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
—
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.
Researcher reviews
Best articles by citations
Box-trees for collision checking in industrial installations
View moreWrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker
View moreDynamic algorithms for geometric spanners of small diameter: Randomized solutions
View moreDesign and analysis of planar shape deformation
View moreDensest translational lattice packing of non-convex polygons
View moreConvexity minimizes pseudo-triangulations
View moreConstructing convex 3-polytopes from two triangulations of a polygon
View moreConforming Delaunay triangulations in 3D
View moreComputing Voronoi skeletons of a 3-D polyhedron by space subdivision
View moreComputing half-plane and strip discrepancy of planar point sets
View moreComputing fence designs for orienting parts
View moreCompetitive searching in a generalized street
View moreCharacterization of contour elements that generate abstract Voronoi diagrams
View more3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
View moreBeta-skeletons have unbounded dilation
View moreAverage case analysis of dynamic geometric optimization
View moreArt galleries with guards of uniform range of vision
View moreArea-efficient algorithms for straight-line tree drawings
View moreAn elementary algorithm for reporting intersections of red/blue curve segments
View moreAn approximation algorithm for cutting out convex polygons
View moreAlgebraic methods and arithmetic filtering for exact predicates on circle arcs
View moreA note on parallel algorithms for optimal h-v drawings of binary trees
View moreA Helly-type theorem for higher-dimensional transversals
View moreA dense planar point set from iterated line intersections
View more