Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.1
1.8
Journals
Algorithms
Special Issues
Machine Learning in Computational Geometry
share announcement

Machine Learning in Computational Geometry

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Analysis of Algorithms and Complexity Theory".

Deadline for manuscript submissions: closed (15 May 2023) | Viewed by 14227

Special Issue Editors

Dr. Andreas Kanavos

E-Mail Website
Guest Editor
Department of Computer Engineering and Informatics, University of Patras, 26504 Rio Achaia, Greece
Interests: data management for smart city governance; artificial intelligence for smart cities; big data in the context of urban sustainability; machine learning for advanced digital manufacturing
Special Issues, Collections and Topics in MDPI journals
Dr. Christos Makris

E-Mail Website
Guest Editor
Department of Computer Engineering and Informatics, University of Patras, 26504 Rio Achaia, Greece
Interests: data structures; information retrieval; data mining; bioinformatics; string algorithmic; computational geometry; multimedia databases; internet technologies
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Computational geometry is a discipline of computer science devoted to the study of problems which can be stated in terms of geometric objects, such as points, lines, circles, and other structures in geometric spaces.

Machine learning concerns techniques that can learn from and make predictions on data. Such techniques and algorithms are built to explore the useful pattern of the input data, which usually can be stated in terms of geometry (e.g., problems in a high-dimensional feature space). Hence, computational geometry plays a crucial and natural role in machine learning. Importantly, geometric algorithms often come with quality guaranteed solutions when dealing with high-dimensional data.

This Special Issue is particularly interested in applications of geometric algorithms in machine learning, both in theory, algorithms, and applications. We are soliciting research and review articles covering a wide range of topics on computational geometry, including (though not limited to) the following:

  • Design, analysis and computational complexity of geometric algorithms;
  • Discrete and combinatorial geometry;
  • Computational topology;
  • Geographic information systems;
  • Applications of computational geometry in any field.

Dr. Andreas Kanavos
Dr. Christos Makris
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • computational geometry
  • algorithmic geometry
  • numerical computational geometry
  • geometric modeling
  • geometric algorithms
  • computational complexity of geometric problems
  • discrete and combinatorial geometry
  • computational topology
  • combinatorial optimization
  • graph drawing

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (3 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

13 pages, 305 KiB  
Article
Folding Every Point on a Polygon Boundary to a Point
by Nattawut Phetmak and Jittat Fakcharoenphol
Algorithms 2023, 16(6), 281; https://doi.org/10.3390/a16060281 - 31 May 2023
Viewed by 1739
Abstract
We consider a problem in computational origami. Given a piece of paper as a convex polygon P and a point f located within, we fold every point on a boundary of P to f and compute a region that is safe from folding, [...] Read more.
We consider a problem in computational origami. Given a piece of paper as a convex polygon P and a point f located within, we fold every point on a boundary of P to f and compute a region that is safe from folding, i.e., the region with no creases. This problem is an extended version of a problem by Akitaya, Ballinger, Demaine, Hull, and Schmidt that only folds corners of the polygon. To find the region, we prove structural properties of intersections of parabola-bounded regions and use them to devise a linear-time algorithm. We also prove a structural result regarding the complexity of the safe region as a variable of the location of point f, i.e., the number of arcs of the safe region can be determined using the straight skeleton of the polygon P. Full article
(This article belongs to the Special Issue Machine Learning in Computational Geometry)
►▼ Show Figures

Figure 1

14 pages, 1221 KiB  
Article
Line Clipping in 3D: Overview, Techniques and Algorithms
by Dimitrios Matthes and Vasileios Drakopoulos
Algorithms 2023, 16(4), 201; https://doi.org/10.3390/a16040201 - 9 Apr 2023
Viewed by 8947
Abstract
Clipping algorithms essentially compute the intersection of the clipping object and the subject, so to go from two to three dimensions we replace the two-dimensional clipping object by the three-dimensional one (the view frustum). In three-dimensional graphics, the terminology of clipping can be [...] Read more.
Clipping algorithms essentially compute the intersection of the clipping object and the subject, so to go from two to three dimensions we replace the two-dimensional clipping object by the three-dimensional one (the view frustum). In three-dimensional graphics, the terminology of clipping can be used to describe many related features. Typically, “clipping” refers to operations in the plane that work with rectangular shapes, and “culling” refers to more general methods to selectively process scene model elements. The aim of this article is to survey important techniques and algorithms for line clipping in 3D, but it also includes some of the latest research performed by the authors. Full article
(This article belongs to the Special Issue Machine Learning in Computational Geometry)
►▼ Show Figures

Figure 1

8 pages, 254 KiB  
Article
Higher-Order Curvatures of Plane and Space Parametrized Curves
by Mircea Crasmareanu
Algorithms 2022, 15(11), 436; https://doi.org/10.3390/a15110436 - 18 Nov 2022
Cited by 1 | Viewed by 2139
Abstract
We start by introducing and studying two sequences of curvatures provided by the higher-order derivatives of the usual Frenet equation of a given plane curve C. These curvatures are expressed by a recurrence starting with the pair [...] Read more.
We start by introducing and studying two sequences of curvatures provided by the higher-order derivatives of the usual Frenet equation of a given plane curve C. These curvatures are expressed by a recurrence starting with the pair (0,−k) where k is the classical curvature function of C. Moreover, for the space curves, we succeed in introducing three recurrent sequences of curvatures starting with the triple (−k,0,τ). Some kinds of helices of a higher order are defined. Full article
(This article belongs to the Special Issue Machine Learning in Computational Geometry)
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-3
Back to TopTop