ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “geometry-aware algorithms”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGcs.CGcs.CVEmpiricalRecentJun 4, 2026

Efficient Mean Curvature Computation on High-Dimensional Data Manifolds

Alexandre L. M. Levada

This paper introduces a new method to estimate local mean curvature in high-dimensional datasets efficiently.

View →
cs.CGcs.DMTheoreticalRecentJul 1, 2026

On Reconstructing a Convex Polygon from Partial Information

Alexander Baumann, Therese Biedl, Mahmoud Elashmawi, Simon D. Fink +2 more

This paper systematically explores the convex polygon reconstruction problem with specified sets of features, contributing new testing algorithms and hardness results.

View →
cs.DSTheoreticalRecentSep 18, 2026

Faster SVP in Polynomial Space

Yansong Feng, Yiming Gao, Jiaqi Liu

The paper presents a randomized algorithm that solves the exact Euclidean shortest vector problem in polynomial space and improved time complexity.

View →
cs.PLcs.MSTheoreticalRecentOct 30, 2026

Grassmann: The Coordinate-Independent Linear Algebra Programming Language

Theadora Fields Collin, Gilbert Bernstein, Oded Stein, Saman Amarasinghe

The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.

View →
cs.DSEmpiricalRecentJun 24, 2026

Paths and Intersections: Recognizing Outerplanar Metrics

Yu Chen, Zihan Tan

One clear sentence describing what this paper does

View →
cs.DScs.DMTheoreticalRecentJun 29, 2026

Algorithms and complexity for geodetic sets on interval and chordal graphs

Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat +1 more

This paper shows that finding the minimum geodetic set in chordal graphs is fixed parameter tractable, implying a polynomial-time algorithm for k-trees. It also proves that the problem is NP-hard on i…

View →
cs.LGmath.OCstat.MLTheoreticalRecentJun 29, 2026

Curvature-Weighted Gradient Diversity: A Noise Measure for Geometry-Adaptive SGD Schedules

Muhammad Hamza, Ayush Goel

This paper introduces Curvature-Weighted Gradient Diversity (CWGD), a geometry-aware measure for optimization noise that reduces the asymptotic optimization error floor by up to a factor of two compar…

View →
cs.CVRecentJun 1, 2026

From Extrinsic to Intrinsic: Geodesic-Guided Representation Learning for 3D Geometric Data

Yuming Zhao, Junhui Hou, Qijian Zhang, Jia Qin +1 more

The paper introduces PRISM, a novel representation learning framework that learns isometric embeddings by explicitly modeling the intrinsic geodesic metric of 3D surfaces, achieving superior performan…

View →
math.STcs.LGstat.MLSurveyRecentJun 15, 2026

Learning the Geometry of Data: A Mathematical Review of Shape Space Analysis

Gary P. T. Choi, Khanh Dao Duc, Shira Faigenbaum-Golovin, Karen Habermann +5 more

This paper surveys the rapidly growing body of work on shape space analysis, providing a mathematical and computational framework for studying geometric data.

View →
cs.DSEmpiricalRecentAug 5, 2026

Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics

Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen +1 more

This paper demonstrates that treewidth dynamic programming (TDP) can be used to enhance the performance of various graph combinatorial optimization algorithms.

View →
cs.CVRecentJun 1, 2026

Geometry-Aware Implicit Memory for Video World Models

Zhengxuan Wei, Xu Guo, Xinghui Li, Xunzhi Xiang +7 more

The paper proposes GIM-World, a geometry-aware implicit memory framework that significantly improves long-horizon video world models by explicitly encoding 3D scene geometry into a compact memory stat…

View →
cs.CGcs.DMEmpiricalRecentJul 25, 2026

How to Draw a Planar Graph: An Experimental Evaluation

Sergey Pupyrev

This paper experimentally evaluates various planar graph drawing algorithms and compares their performance in terms of visual properties.

View →
cs.ITmath.PRmath.STTheoreticalRecentJun 15, 2026

Testing for a Hidden Geometry in Random Graphs

Amit Silber, Mor Oren-Loberman, Wasim Huleihel

This paper studies the problem of detecting a hidden geometric signal in a random graph.

View →
stat.MLcs.CGcs.CLTheoreticalRecentJun 16, 2026

Compact Geometric Representations of Hierarchies

Prashant Gokhale, Piotr Indyk, Yuhao Liu, Sandeep Silwal +2 more

This paper investigates compact reachability embeddings for hierarchical data and provides theoretical guarantees for representing hierarchies using embeddings with dimensions dependent on graph param…

View →
cs.DScs.CGcs.LGTheoreticalRecentJul 3, 2026

Dimension Reduction for Curves: Simplified and Generalized

Matthijs Ebbens, Jie Lu, Alexander Munteanu

This paper simplifies the proof of the bound on the target dimension for reducing the dimension of high-dimensional polygonal curves using random projections, extending it to various distance measures…

View →
cs.GRcs.CGRecentMay 30, 2026

Subgrid Marching Tetrahedra

Hossein Baktash, Mark Gillespie, Keenan Crane

The paper introduces a subgrid marching tetrahedra scheme that accurately recovers complex, intersection-free manifold meshes from tetrahedral grids, overcoming limitations of classic marching methods…

View →