Discover the blend of fractals and advanced numbers for stunning visuals.
― 5 min read
Computer Science - Computational Geometry
RSSLatest Articles
Latest Articles
A look into 2-parameter persistence and its role in data analysis.
― 5 min read
This study explores how path lengths in graphs on tori can be understood.
― 4 min read
Explore the properties and characteristics of knots in mathematics.
― 5 min read
A look at edge densities and distributions in maximal 2-planar graphs.
― 5 min read
Exploring Voronoi diagrams through Hilbert geometry reveals new insights and applications.
― 6 min read
A new algorithm streamlines the process of creating convex hulls in various applications.
― 4 min read
Learn about secluded partitions and their role in data handling and algorithms.
― 6 min read
TAS-Paths improves safety and efficiency in spectrometer motion planning.
― 4 min read
Exploring methods that clarify deep learning model decisions.
― 7 min read
A new method improves speed and accuracy in penetration depth estimation for robotics.
― 6 min read
This article focuses on enhancing the layout of nearly planar graphs for better visualization.
― 6 min read
A mathematical method for analyzing complex data shapes and structures.
― 5 min read
Combining clustering with topological analysis reveals hidden structures in high-dimensional data.
― 6 min read
Learn how Voronoi diagrams optimize floodlight placement for effective illumination.
― 7 min read
This article discusses the complexities of imprecise polylines and their applications.
― 7 min read
A look at the nearest neighbor problem for polygonal curves and Fréchet distance.
― 5 min read
Examining how to prevent collisions in modular robotic systems.
― 5 min read
An analysis of crease-free folding in convex polygons and its implications.
― 5 min read
Introducing hyperbolic quadtrees for efficient data organization in unique geometries.
― 5 min read
A new model improves route optimization for the Traveling Salesman Problem using deep learning techniques.
― 7 min read
A look into making clustering results easier to explain and understand.
― 5 min read
New algorithms for efficient geometric set cover addressing MMGSC and MPGSC challenges.
― 6 min read
A method to reduce movement of mobile sensors while covering essential targets.
― 5 min read
A new method improves topological data representation for machine learning.
― 5 min read
Introducing a novel method for creating high-quality meshes from point cloud data.
― 6 min read
Clustering helps identify patterns in data across various fields.
― 4 min read
This article examines a method to find empty spaces separating colored points on a plane.
― 4 min read
A new method creates clear and compact tree diagrams for better data understanding.
― 5 min read
A new approach to manage self-intersections and improve collision detection in graphical simulations.
― 5 min read
Two innovative algorithms improve convex hull finding for large datasets.
― 5 min read
A look into funnel polygons, hidden sets, and convex covers.
― 4 min read
A new method improves geometric graph efficiency for various applications.
― 4 min read
A method for grouping line segments and polylines based on distance measurement.
― 4 min read
Learn how AFM reshapes meshes while preserving their structure.
― 4 min read
An overview of circuit polynomials and their significance in point arrangements.
― 5 min read
This article examines the complexities of shortest paths in graph associahedra.
― 8 min read
TrueKNN improves neighbor search by dynamically adjusting the search radius.
― 6 min read
A method for analyzing complex point data using 2-complex structures.
― 4 min read
A look into the Closest String problem and its applications in various fields.
― 4 min read
A new method enhances how we process complex data by recognizing symmetries.
― 5 min read