Introducing a novel method for creating high-quality meshes from point cloud data.
― 6 min read
Computer Science - Computational Geometry
RSSLatest Articles
Latest Articles
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
AUC-opt aims to enhance the Area Under the ROC Curve for classification models.
― 6 min read
A look into the Steiner Tree problem and its applications across various fields.
― 6 min read
A new method enhances how we compare geometric graphs efficiently.
― 5 min read
A novel approach to efficiently list paths on polyhedral surfaces.
― 5 min read
Exploring the complexity of crossing numbers in almost planar and anchored planar graphs.
― 4 min read
A new algorithm outperforms existing methods for point-in-polygon checks.
― 5 min read
Exploring techniques to reduce graphs while preserving key distance relationships.
― 4 min read
Exploring the intricacies and challenges of disk packing in geometry.
― 7 min read
Explore an optimization challenge in connecting locations using Steiner points.
― 5 min read
A new method improves mesh generation for accurate surface representation.
― 7 min read
New research reveals methods to detect and address gerrymandering using random districting plans.
― 5 min read
Research unveils methods to test if crease patterns can be folded flat.
― 5 min read
This article explores challenges and solutions in finding optimal observation paths.
― 6 min read
A look at techniques to improve curvature estimation from noisy point cloud data.
― 6 min read
Robots efficiently create shapes using color codes and specific movement strategies.
― 5 min read
Exploring ε-covers for efficient querying in high-dimensional data analysis.
― 5 min read
This study focuses on minimizing network lengths connecting specific points in geometry.
― 5 min read
This research examines methods to eliminate crossing segments using flips.
― 4 min read
New model improves how knowledge graphs represent concepts and entities.
― 5 min read
Discover the complexities behind Olivier Longuet's unique Calissons Puzzle and its mathematical implications.
― 6 min read
This study examines various methods to analyze resting-state fMRI data.
― 8 min read
New algorithm estimates Chamfer distance faster and more accurately for large datasets.
― 5 min read
This study optimizes the location of preferable and undesirable facilities.
― 5 min read
A new framework enhances data analysis by addressing multiparameter challenges.
― 6 min read
New methods for faster solutions to TSP and MST problems.
― 4 min read
Examining the role of flip-width in the complexity of geometric graphs.
― 5 min read
A new approach to create quality meshes using grid-based techniques.
― 5 min read
Exploring how to cover geometric graphs with star-forests efficiently.
― 5 min read
This article explores how to estimate set sizes using point samples and polynomial volume functions.
― 6 min read
A new algorithm for grouping similar movement paths in large datasets.
― 6 min read