Flips in planar graphs
P Bose, F Hurtado - Computational Geometry, 2009 - Elsevier
We review results concerning edge flips in planar graphs concentrating mainly on various
aspects of the following problem: Given two different planar graphs of the same size, how …
aspects of the following problem: Given two different planar graphs of the same size, how …
Progressive lossless mesh compression via incremental parametric refinement
In this paper, we propose a novel progressive lossless mesh compression algorithm based
on Incremental Parametric Refinement, where the connectivity is uncontrolled in a first step …
on Incremental Parametric Refinement, where the connectivity is uncontrolled in a first step …
[PDF][PDF] Diagonal flips of triangulations on surfaces, a survey
S Negami - Yokohama Mathematical Journal= 横濱市立大學紀要 …, 1999 - ynu.repo.nii.ac.jp
DIAGONAL FLIPS OF TRIANGULATIONS Page 1 YOKOHAMA MATHEMATICAL JOURNAL
VOL. 47, 1999 SPECIAL ISSUE DIAGONAL FLIPS OF TRIANGULATIONS ON SURFACES …
VOL. 47, 1999 SPECIAL ISSUE DIAGONAL FLIPS OF TRIANGULATIONS ON SURFACES …
Computing the flip distance between triangulations
Let TT be a triangulation of a set PP of n points in the plane, and let e be an edge shared by
two triangles in TT such that the quadrilateral Q formed by these two triangles is convex. A …
two triangles in TT such that the quadrilateral Q formed by these two triangles is convex. A …
[HTML][HTML] Theory on structure and coloring of maximal planar graphs (2) Domino configurations and extending-contracting operations
XU ** - Journal of Electronics, 2016 - jeit.ac.cn
The first paper of this series of articles revealed that Four-Color Conjecture is hopefully
proved mathematically by investigating a special class of graphs, called the 4-chromatic …
proved mathematically by investigating a special class of graphs, called the 4-chromatic …
A history of flips in combinatorial triangulations
LNCS 7579 - A History of Flips in Combinatorial Triangulations Page 1 A History of Flips in
Combinatorial Triangulations ⋆,⋆⋆ Prosenjit Bose and Sander Verdonschot School of …
Combinatorial Triangulations ⋆,⋆⋆ Prosenjit Bose and Sander Verdonschot School of …
Simultaneous diagonal flips in plane triangulations
Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every
triangulation with n≥ 6 vertices has a simultaneous flip into a 4‐connected triangulation …
triangulation with n≥ 6 vertices has a simultaneous flip into a 4‐connected triangulation …
Graph Theory Towards New Graphical Passwords In Information Networks
B Yao, H Sun, H Wang, J Su, J Xu - arxiv preprint arxiv:1806.02929, 2018 - arxiv.org
Graphical passwords (GPWs) have been studied over 20 years. We are motivated from QR
codes that can be considered GPWs, are successfully applied in today's world. However …
codes that can be considered GPWs, are successfully applied in today's world. However …
[PDF][PDF] 极大**面图的结构与着色理论
许进 - 电子与信息学报, 2016 - jeit.ac.cn
业已证明四色猜想的数学证明可归结为刻画4-色漏斗型伪唯一4-色极大**面图的特征.
为刻画此类极大**面图的结构特征, 本文提出一种构造极大**面图的方法扩缩运算. 研究发现 …
为刻画此类极大**面图的结构特征, 本文提出一种构造极大**面图的方法扩缩运算. 研究发现 …
[LIVRE][B] Graph drawing
J Pach - 2005 - Springer
The 12th International Symposium on Graph Drawing (GD 2004) was held during
September 29–October 2, 2004, at City College, CUNY, in the heart of Harlem, New York …
September 29–October 2, 2004, at City College, CUNY, in the heart of Harlem, New York …