20 results for “geometry-aware algorithms”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper introduces a new method to estimate local mean curvature in high-dimensional datasets efficiently.
This paper systematically explores the convex polygon reconstruction problem with specified sets of features, contributing new testing algorithms and hardness results.
The paper presents a randomized algorithm that solves the exact Euclidean shortest vector problem in polynomial space and improved time complexity.
The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.
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…
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…
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…
This paper surveys the rapidly growing body of work on shape space analysis, providing a mathematical and computational framework for studying geometric data.
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.
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…
This paper experimentally evaluates various planar graph drawing algorithms and compares their performance in terms of visual properties.
This paper studies the problem of detecting a hidden geometric signal in a random graph.
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…
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…
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…