Image de couverture de livre

Feature-aware manifold meshing and remeshing of point clouds and polyhedral surfaces with guaranteed smallest edge length

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lipschütz, Henriette, Reitebuch, Ulrich, Polthier, Konrad, Skrodzki, Martin
Format:	Preprint
Publié:	2023
Sujets:	Computational Geometry Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Interior-point methods on manifolds: theory and applications
par: Hirai, Hiroshi, et autres
Publié: (2023)

Unit-length Rectangular Drawings of Graphs
par: Alegria, Carlos, et autres
Publié: (2022)

Random zero sets with local growth guarantees
par: Chang, Alan, et autres
Publié: (2024)

Parameterized and approximation algorithms for coverings points with segments in the plane
par: Kowalska, Katarzyna, et autres
Publié: (2024)

Computing largest minimum color-spanning intervals of imprecise points
par: Acharyya, Ankush, et autres
Publié: (2024)

Hashing geographical point data using the space-filling H-curve
par: Netay, Igor V.
Publié: (2024)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
par: Gudmundsson, Joachim, et autres
Publié: (2022)

Simple Grid Polygon Online Exploration Revisited
par: Brock, Maximilian, et autres
Publié: (2024)

The Peculiarities of Extending Queue Layouts
par: Depian, Thomas, et autres
Publié: (2025)

The Parameterized Complexity of Extending Stack Layouts
par: Depian, Thomas, et autres
Publié: (2024)

Visualizing Treewidth
par: Chiu, Alvin, et autres
Publié: (2025)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
par: Herold, Martin G., et autres
Publié: (2025)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
par: Dobler, Alexander, et autres
Publié: (2024)

Dynamic and Streaming Algorithms for Union Volume Estimation
par: Bhore, Sujoy, et autres
Publié: (2026)

Approximation Algorithms for Smallest Intersecting Balls
par: Zheng, Jiaqi, et autres
Publié: (2024)

Light Spanners with Small Hop-Diameter
par: Bhore, Sujoy, et autres
Publié: (2025)

Faster exponential algorithms for cut problems via geometric data structures
par: Kozma, László, et autres
Publié: (2025)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
par: Depian, Thomas, et autres
Publié: (2025)

A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
par: Gusain, Rachana, et autres
Publié: (2025)

Counting Unit Circular Arc Intersections
par: Wang, Haitao
Publié: (2026)

Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model
par: Nekrich, Yakov, et autres
Publié: (2026)

Upward-Planar Drawings with Bounded Span
par: Angelini, Patrizio, et autres
Publié: (2026)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
par: Park, Seongbin, et autres
Publié: (2026)

On Approximating the Weighted Region Problem in Square Tessellations
par: Kakimura, Naonori, et autres
Publié: (2024)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
par: Abrahamsen, Mikkel, et autres
Publié: (2024)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
par: Bhore, Sujoy, et autres
Publié: (2024)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
par: Liu, Shuilian, et autres
Publié: (2025)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
par: van der Hoog, Ivor, et autres
Publié: (2025)

Scalable Exact Hierarchical Agglomerative Clustering via Sparse Geographic Distance Graphs
par: Maus, Victor, et autres
Publié: (2026)

Online Algorithms for Geometric Independent Set
par: De, Minati, et autres
Publié: (2026)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
par: Grandoni, Fabrizio, et autres
Publié: (2026)

Hitting Axis-Parallel Segments with Weighted Points
par: Raman, Rajiv, et autres
Publié: (2026)

Deterministic Volume Estimation of Truncated Hypercubes
par: Gunluk, Kyra
Publié: (2026)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2026)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
par: Chan, Timothy M., et autres
Publié: (2026)

On Optimal Coreset Construction for Euclidean $(k,z)$-Clustering
par: Huang, Lingxiao, et autres
Publié: (2022)

Scattering and Sparse Partitions, and their Applications
par: Filtser, Arnold
Publié: (2020)

Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs
par: Banik, Aritra, et autres
Publié: (2025)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
par: Cabello, Sergio, et autres
Publié: (2021)