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

20 results for “topological mapping”

CS papers only

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

Want pure semantic search? Try claim verification →

cs.CVcs.ROeess.IVEmpiricalRecentJul 23, 2026

HGeo-TopoMap: Boosting Topological Mapping with Hierarchical Geometric Priors

Siyu Li, Kunyu Peng, Di Wen, Beiping Hou +2 more

This paper proposes HGeo-TopoMap, a method for topological mapping in autonomous driving using an explicit prior map and implicit spatial relations, achieving substantial improvements in accuracy and…

View →
cs.CGcs.DSTheoreticalRecentJul 3, 2026

Shortest Path Map Equivalence Decompositions and Applications

Haitao Wang

This paper provides new upper bounds and algorithms for the shortest path map equivalence decomposition of a polygonal domain, leading to solutions for two-point shortest path queries, geodesic diamet…

View →
cs.DMcs.DSEmpiricalRecentJun 11, 2026

Exhaustive Generation of Genus-One Knot and Link Diagrams via Maps on the Torus

Alexander Omelchenko

This paper presents an algorithmic framework for exhaustively generating and tabulating knot and link diagrams on the thickened torus.

View →
math.ATcs.CGmath-phRecentMay 27, 2026

Gauge Geometry of Hodge Zero-Mode Transport in Parameter-Dependent Topological Data Analysis

Satoshi Kanno, Rei Nishimura, Hiroshi Yamauchi, Yoshi-aki Shimada

The paper introduces a computational framework using Hodge zero-modes to track the geometry of topological features in parameter-dependent data, providing metrics like curvature and holonomy to quanti…

View →
quant-phcs.CGmath.ATRecentMay 27, 2026

Quantum encodings that preserve persistent homology

Arthur J. Parzygnat, Andrew Vlasic

The paper investigates which quantum encodings can be applied directly to classical data point clouds while preserving the topological invariants necessary for topological data analysis (TDA).

View →
cs.CVcs.AIEmpiricalRecentJun 26, 2026

Learning Topology-Aware Representations via Test-Time Adaptation for Anomaly Segmentation

Ali Zia, Usman Ali, Abdul Rehman, Umer Ramzan +4 more

The paper introduces TopoTTA, a framework that uses persistent homology for topological data analysis to enhance the quality of anomaly segmentation in deep models, leading to an average 15% F1 improv…

View →
cs.CGmath.ATmath.CORecentMay 29, 2026

Towards fast computation of higher discrete homology

Jacob Ender, Chris Kapulkin

The paper presents a novel and significantly faster algorithm for computing the second discrete homology group of a graph by identifying five basic quotient shapes of the 3-cube.

View →
cs.LOcs.PLmath.CTTheoreticalRecentJul 19, 2026

Topology in Synthetic Domain Theory and its Formalisation in Agda

Runze Xue

This paper generalizes the Phoa principle in synthetic domain theory to transfinite cases, introduces sobriomorphisms, and proposes a hypothetical completeness theorem.

View →
cs.AIRecentMay 28, 2026

Procedural Generation of First Person Shooter Maps using Map-Elites

Simone de Donato, Pier Luca Lanzi, Daniele Loiacono

This paper applies the MAP-Elites algorithm to procedurally generate diverse and high-quality First-Person Shooter maps using novel map representations.

View →
cs.LGcs.AIcs.CERecentJun 1, 2026

On the Generalization in Topology Optimization via Sensitivity-Conditioned Bernoulli Flow Matching

Mohammad Rashed, Duarte F. Valoroso Madeira, Babak Gholami, Caglar Guerbuez +2 more

The paper proposes using pseudo-sensitivities, derived from adjoint sensitivity fields, as an optimal conditioning signal in a Bernoulli flow-matching framework to significantly improve the out-of-dis…

View →
cs.CCcs.DMcs.DSTheoreticalRecentJul 3, 2026

Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width

Thobias Kvalvik Høivik, Erlend Raa Vågset

The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…

View →
q-bio.NCcs.AIcs.LGEmpiricalRecentJul 10, 2026

PHINN-EEG: Topological Time-Series Analysis of Dream-State EEG -- Dynamic Betti Curves for Dream Content Classification and Topology-Conditioned Neural Signal Synthesis

Ren Takahashi, Emre Yusuf, Jayabrata Bhaduri

This paper introduces PHINN-EEG, a topological time-series framework for dream mentation analysis using Dynamic Betti Curves and topology-conditioned flow matching, aiming for higher area under the re…

View →
math.COcs.DMTheoreticalRecentJul 22, 2026

Polyhedral Maps of Cubic Graphs with given Automorphism Groups

Ugo Detaille, Meike Weiß, Reymond Akpanya, Alice C. Niemeyer

This paper constructs a cubic graph with a polyhedral map whose automorphism groups are isomorphic to a given finite group.

View →
quant-phcs.CCcs.LGTheoreticalRecentJul 3, 2026

Complexity of Normalized Persistence Problems for Topological Data Analysis and Local Hamiltonians

Dominic Lowe, M. S. Kim, Roberto Bondesan, Ryu Hayakawa

This paper introduces normalized persistence, a version of persistent homology in topological data analysis, and proves its quantum hardness under the standard assumption that DQC1 is not in BPP.

View →
cs.AIcs.CVphysics.bio-phRecentJun 1, 2026

Topological texture analysis of microscopy images of dynamic casein gelation and its relation to rheological properties

Zahra Tabatabaei, Diana Soto Aguilar, Jose C. Bonilla, Mathias P. Clausen +1 more

The paper introduces an integrated computational toolbox using topological and fractal analysis to quantitatively track microstructural changes during casein gelation, correlating these subtle changes…

View →
cs.CGRecentMay 31, 2026

On Fréchet Traveling Salesmen Problems

Omrit Filtser, Tzalik Maimon, Michal Moiseev

This paper introduces a new variant of the Traveling Salesman Problem where the goal is to find two paths connecting a set of sites while minimizing the Fréchet distance between the two paths.

View →
cs.DScs.CCcs.DMTheoreticalRecentJun 26, 2026

Maximum Cut Algorithms and Upper Bounds for Planar and Toroidal Graphs

Mark Glass, Meir Feder

The authors map the problem of finding the maximum cut of a planar graph with arbitrary weights to a minimum T-join problem in the absolute dual graph, enabling the use of shortest paths and adapting…

View →
cs.CGcs.NEmath.NATheoreticalRecentJun 29, 2026

Computing the Integral R2 Indicator by Perspective Mapping and Box Decomposition

Michael T. M. Emmerich

This paper presents a bidirectional perspective mapping between continuous integral R2 computation and integration over unions of anchored axis-aligned boxes, enabling the reuse of hypervolume algorit…

View →
cs.ROEmpiricalRecentJul 17, 2026

A New Implementation of NeoSLAM and a Comparative Evaluation with RatSLAM

Joao Victor T. Borges, Fabio Coelho, Paulo Padrao, Jose Fuentes +3 more

This paper presents a new modular architecture for NeoSLAM using modern frameworks, achieving real-time execution and minimal data discarding. It also compares NeoSLAM and RatSLAM across three dataset…

View →