Write in a clean editor, then format for International Journal of Computational Geometry & Applications in one click — DocuGuru applies the official World Scientific template with superscript references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
International Journal of Computational Geometry & Applications is a peer-reviewed journal published by World Scientific, covering Computational Geometry and Mesh Generation, Advanced Numerical Analysis Techniques, Data Management and Algorithms.
| Publisher | World Scientific |
|---|---|
| Reference style | Superscript numbered (World Scientific) Superscript — small raised numerals in the text 1. Smith, A., Jones, B. & Lee, C. A representative article title. International Journal of Computational Geometry & Applications 12, 45–58 (2023).
Formats any DOI in the closest standard style — International Journal of Computational Geometry & Applications has no published style definition, so this is an approximation. No sign-up. |
| Publishes research in | Computational Geometry and Mesh Generation Advanced Numerical Analysis Techniques Data Management and Algorithms Digital Image Processing Techniques Robotic Path Planning Algorithms |
| ISSN | 0218-1959 |
| Citation impact (2-yr) | 0.06 |
| h-index | 57 |
| i10-index | 346 |
| Total citations | 14,924 |
| Top institutions publishing here | Smith College |
| Journal website | www.worldscinet.com |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
As a measure for the resemblance of curves in arbitrary dimensions we consider the so-called Fréchet-distance, which is compatible with parametrizations of the curves. For polygonal chains P and Q consisting of p and q edges an algorithm of runtime O(pq log(pq)) measuring the Fréchet-distance between P and Q is developed. Then some important variants…
This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually "see" an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. This problem was first introduced by Suzuki and Yamashita. Our study of this problem is motivated in part…
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomly-sampled milestones. The analysis of expansive configuration spaces has inspired us to develop a new randomized planning algorithm. This new algorithm tries to sample only the portion of the configuration space…
In this paper we describe and analyze a method based on local least square fitting for estimating the normals at all sample points of a point cloud data (PCD) set, in the presence of noise. We study the effects of neighborhood size, curvature, sampling density, and noise on the normal estimation when the PCD is…
The scope of this work is Geometric Modeling. We study the representation and the construction of subdivisions of quasi-manifolds, using a topology-based approach. Quasi-manifolds are here defined as a subset of pseudo-manifolds, which are well-known objects in Algebraic Topology. N-dimensional generalized maps (resp. n-dimensional maps) are combinatorial models defined for representing the topology of subdivisions…
