Skip to search formSkip to main contentSkip to account menu

Pseudotriangle

Known as: Pseudo-triangle, Pseudo-triangulation, Pseudotriangulation 
In Euclidean plane geometry, a pseudotriangle (pseudo-triangle) is the simply connected subset of the plane that lies between any three mutually… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Minimal crystallizations of simply connected PL 4-manifolds are very natural objects. Many of their topological features are… 
2013
2013
We have introduced the weight of a group which has a presentation with number of relations is at most the number of generators… 
2013
2013
Let P ⊂ R 2 be a set of n points. In [1] and [2] an algorithm for counting triangulations and pseudo-triangulations of P… 
2010
2010
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show… 
2008
2008
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and… 
2006
2006
We show that the problem of deciding if a pseudotriangulation is contained inside a geometric graph is NP-complete. For this we… 
2005
2005
We are interested in learning generative models of objects that can be used in wide range of tasks such as video summarization… 
1998
1998
A polygonal cover of a nite collection of pairwise disjoint convex compact sets in the plane is a nite collection of non… 
1990
1990
A study is made of the effect of errors in estimates of the image center and focal length on pose refinement and other related (3…