Improved Examples of Non-Termination for Ruppert's Algorithm
Computational Geometry
2011-03-22 v1
Authors:
Alexander Rand
Abstract
Improving the best known examples, two planar straight-line graphs which cause the non-termination of Ruppert's algorithm for a minimum angle threshold as low as 29.06 degrees are given.
Cite
@article{arxiv.1103.3903,
title = {Improved Examples of Non-Termination for Ruppert's Algorithm},
author = {Alexander Rand},
journal= {arXiv preprint arXiv:1103.3903},
year = {2011}
}
Related papers
View all related →
Computational Geometry · Computer Science
On the Non-Termination of Ruppert's Algorithm
Alexander Rand
2015-03-17
Data Structures and Algorithms · Computer Science
A near-linear time minimum Steiner cut algorithm for planar graphs
Stephen Jue, Philip N. Klein
2020-01-01
Disordered Systems and Neural Networks · Physics
Typical Performance of Approximation Algorithms for NP-hard Problems
Satoshi Takabe, Koji Hukushima
2016-11-10
Combinatorics · Mathematics
Families of parameters for SRNT graphs
Norman Biggs
2009-11-13
Data Structures and Algorithms · Computer Science
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings
Therese Biedl, Philippe Demontigny
2017-02-07
Computational Geometry · Computer Science
A Reduction System for Optimal 1-Planar Graphs
Franz J. Brandenburg
2016-10-28
Analysis of PDEs · Mathematics
A pointwise differential inequality and second-order regularity for nonlinear elliptic systems
Anna Kh. Balci, Andrea Cianchi, Lars Diening, Vladimir Maz'ya
2021-02-19
Combinatorics · Mathematics
Random graphs with bounded maximum degree: asymptotic structure and a logical limit law
Vera Koponen
2012-12-18
Combinatorics · Mathematics
Graphs with girth at least 5 with orders between 20 and 32
Alice Miller, Michael Codish
2017-08-24
Combinatorics · Mathematics
On Expansion of Random Regular Graphs: Improved Lower Bounds for Small Even Degrees
Pasin Manurangsi
2026-04-02
Computational Geometry · Computer Science
Non-aligned drawings of planar graphs
Therese Biedl, Claire Pennarun
2016-11-29
Optimization and Control · Mathematics
Tilt Stability for Nonlinear Programs under Relaxed Constant Rank Constraint Qualification
Nguyen Huy Chieu, Nguyen Thi Quynh Trang, Nguyen Thi Hai Yen
2025-08-12
Combinatorics · Mathematics
Another approach to non-repetitive colorings of graphs of bounded degree
Matthieu Rosenfeld
2020-06-24
Computational Geometry · Computer Science
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen +4
2022-07-18
Optimization and Control · Mathematics
On the Optimal Ergodic Sublinear Convergence Rate of the Relaxed Proximal Point Algorithm for Variational Inequalities
Guoyong Gu, Junfeng Yang
2019-07-15
Combinatorics · Mathematics
Maximising line subgraphs of diameter at most $t$
Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang
2021-12-13
Numerical Analysis · Mathematics
Optimal error estimates for non-conforming approximations of linear parabolic problems with minimal regularity
J Droniou, R Eymard, T Gallouët, C Guichard +1
2023-08-22
Data Structures and Algorithms · Computer Science
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger
2016-12-30
Computational Geometry · Computer Science
On Optimal 2- and 3-Planar Graphs
Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou
2017-03-21
Discrete Mathematics · Computer Science
Recognizing Optimal 1-Planar Graphs in Linear Time
Franz J. Brandenburg
2018-01-25
Commutative Algebra · Mathematics
Regularity of edge ideal of a graph
Marcel Morales, Ali Akbar Yazdan Pour, Rashid Zaare-Nahandi
2015-07-28
Data Structures and Algorithms · Computer Science
A Simple Algorithm for Minimum Cuts in Near-Linear Time
Nalin Bhardwaj, Antonio Molina Lovett, Bryce Sandlund
2020-06-11
Optimization and Control · Mathematics
Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
Bo Wen, Xiaojun Chen, Ting Kei Pong
2016-08-02
Systems and Control · Electrical Eng. & Systems
A Closed-Form Bound on the Asymptotic Linear Convergence of Iterative Methods via Fixed Point Analysis
Trung Vu, Raviv Raich
2022-06-22
Combinatorics · Mathematics
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický +2
2012-06-25