Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lipschütz, Henriette, Reitebuch, Ulrich, Polthier, Konrad, Skrodzki, Martin
Formato:	Preprint
Publicado:	2023
Materias:	Computational Geometry Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Interior-point methods on manifolds: theory and applications
por: Hirai, Hiroshi, et al.
Publicado: (2023)

Unit-length Rectangular Drawings of Graphs
por: Alegria, Carlos, et al.
Publicado: (2022)

Random zero sets with local growth guarantees
por: Chang, Alan, et al.
Publicado: (2024)

Parameterized and approximation algorithms for coverings points with segments in the plane
por: Kowalska, Katarzyna, et al.
Publicado: (2024)

Computing largest minimum color-spanning intervals of imprecise points
por: Acharyya, Ankush, et al.
Publicado: (2024)

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

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
por: Gudmundsson, Joachim, et al.
Publicado: (2022)

Simple Grid Polygon Online Exploration Revisited
por: Brock, Maximilian, et al.
Publicado: (2024)

The Peculiarities of Extending Queue Layouts
por: Depian, Thomas, et al.
Publicado: (2025)

The Parameterized Complexity of Extending Stack Layouts
por: Depian, Thomas, et al.
Publicado: (2024)

Visualizing Treewidth
por: Chiu, Alvin, et al.
Publicado: (2025)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
por: Herold, Martin G., et al.
Publicado: (2025)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
por: Dobler, Alexander, et al.
Publicado: (2024)

Dynamic and Streaming Algorithms for Union Volume Estimation
por: Bhore, Sujoy, et al.
Publicado: (2026)

Approximation Algorithms for Smallest Intersecting Balls
por: Zheng, Jiaqi, et al.
Publicado: (2024)

Light Spanners with Small Hop-Diameter
por: Bhore, Sujoy, et al.
Publicado: (2025)

Faster exponential algorithms for cut problems via geometric data structures
por: Kozma, László, et al.
Publicado: (2025)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
por: Depian, Thomas, et al.
Publicado: (2025)

A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
por: Gusain, Rachana, et al.
Publicado: (2025)

Counting Unit Circular Arc Intersections
por: Wang, Haitao
Publicado: (2026)

Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model
por: Nekrich, Yakov, et al.
Publicado: (2026)

Upward-Planar Drawings with Bounded Span
por: Angelini, Patrizio, et al.
Publicado: (2026)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
por: Park, Seongbin, et al.
Publicado: (2026)

On Approximating the Weighted Region Problem in Square Tessellations
por: Kakimura, Naonori, et al.
Publicado: (2024)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
por: Abrahamsen, Mikkel, et al.
Publicado: (2024)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
por: Bhore, Sujoy, et al.
Publicado: (2024)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
por: Liu, Shuilian, et al.
Publicado: (2025)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Scalable Exact Hierarchical Agglomerative Clustering via Sparse Geographic Distance Graphs
por: Maus, Victor, et al.
Publicado: (2026)

Online Algorithms for Geometric Independent Set
por: De, Minati, et al.
Publicado: (2026)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
por: Grandoni, Fabrizio, et al.
Publicado: (2026)

Hitting Axis-Parallel Segments with Weighted Points
por: Raman, Rajiv, et al.
Publicado: (2026)

Deterministic Volume Estimation of Truncated Hypercubes
por: Gunluk, Kyra
Publicado: (2026)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2026)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
por: Chan, Timothy M., et al.
Publicado: (2026)

On Optimal Coreset Construction for Euclidean $(k,z)$-Clustering
por: Huang, Lingxiao, et al.
Publicado: (2022)

Scattering and Sparse Partitions, and their Applications
por: Filtser, Arnold
Publicado: (2020)

Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs
por: Banik, Aritra, et al.
Publicado: (2025)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
por: Cabello, Sergio, et al.
Publicado: (2021)