ISSN: 0925-7721
Journal Home
Journal Guideline
Computational Geometry: Theory and Applications Q2 Unclaimed
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 60. It has an SJR impact factor of 0,497 and it has a best quartile of Q2. It is published in English. It has an SJR impact factor of 0,497.
Type: Journal
Type of Copyright:
Languages: English
Open Access Policy:
Type of publications:
Publication frecuency: -
- €
Inmediate OANPD
Embargoed OA- €
Non OAMetrics
0,497
SJR Impact factor60
H Index67
Total Docs (Last Year)151
Total Docs (3 years)1614
Total Refs128
Total Cites (3 years)144
Citable Docs (3 years)0.79
Cites/Doc (2 years)24.09
Ref/DocOther journals with similar parameters
Journal of Automated Reasoning Q2
International Journal of Fuzzy Systems Q2
Digital Signal Processing: A Review Journal Q2
Queueing Systems Q2
Expert Systems Q2
Compare this journals
Aims and Scope
Best articles by citations
Multiresolution banded refinement to accelerate surface reconstruction from polygons
View moreLinear area upward drawings of AVL trees
View moreExtending range queries and nearest neighbors
View moreIllumination in the presence of opaque line segments in the plane
View morePolygonal chains cannot lock in 4D
View moreFacility location and the geometric minimum-diameter spanning tree
View moreVisibility graphs of towers
View more3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
View moreEditorial
View moreVisibility preserving terrain simplification - an experimental study
View moreComputing fence designs for orienting parts
View moreMulti-Resolution Modeling and 3D Geometry Compression
View moreOn the number of views of translates of a cube and related problems
View moreComputing half-plane and strip discrepancy of planar point sets
View moreIntersections with random geometric objects
View moreOptimal tetrahedralization of the 3D-region "between" a convex polyhedron and a convex polygon
View moreThe upper bound theorem for polytopes: an easy proof of its asymptotic version
View moreVoronoi Diagrams on orbifolds
View moreThe largest k-ball in a d-dimensional box
View moreMinimizing support structures and trapped area in two-dimensional layered manufacturing
View moreEnumerating a subset of the integer points inside a Minkowski sum
View moreEditorial
View moreEnumerating the k best plane spanning trees
View moreCharacterization of contour elements that generate abstract Voronoi diagrams
View more
Comments