Skip to search formSkip to main contentSkip to account menu

Planarity

Known as: John tantalo 
Planarity is a puzzle computer game by John Tantalo, based on a concept by Mary Radcliffe at Western Michigan University.The name comes from the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Adobe FlashCircular layoutComputational geometryCrossing number (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
TCB optimization for stacking large thinned dies with 40 and 20 μm pitch microbumps
In this paper optimization process of D2W (Die to Wafer) TCB (Thermal Compression Bonding) stacking for thinned, warped and large… 
2015
2015
$h$-perfect plane triangulations
We characterise $t$-perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane… 
2009
2009
A Planarity-Based Complexity Metric
Complexity in product design, e.g. in product architectures or process structures, continuously increases. To properly evaluate a… 
2007
2007
- 1-No News from Stratigraphic Computing ?
What are the issues stratigraphic computing has to deal with? This is a personal view presenting the features of my program… 
Highly Cited
1998
Highly Cited
1998
Quasi-Upward Planarity
AbstractAn upward planar drawing of a directed graph (digraph) is a planar drawing such that all the edges are represented by… 
1997
1997
Planarity in Linear Time Class Notes
I give a self-contained exposition of a linear-time planarity algorithm of Shih and Hsu. 
1993
1993
Programming in Propositional Logic or Reductions: Back to the Roots (Satisfiability)
In this paper, NP-complete and polynomial solvable problems are reduced to the SAT-ISFIABILITY problem. We call this process… 
1993
1993
The Hopcroft-Tarjan Planarity Algorithm
This is an expository article on the Hopcroft-Tarjan planarity algorithm. A graph-theoretic analysis of a version of the… 
1988
1988
Planarity constraint in stereo matching
Stereo problems regarding range resolution, the output available for higher-level postprocessing, and the so-called… 
1970
1970
A new planarity test based on 3-connectivity
In this paper we give a new algorithm for determining if a graph is planar. The algorithm is based on Tutte's theory of 3… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)