Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,287,298 papers from all fields of science
Search
Sign In
Create Free Account
Pseudotriangle
Known as:
Pseudo-triangle
, Pseudo-triangulation
, Pseudotriangulation
Expand
In Euclidean plane geometry, a pseudotriangle (pseudo-triangle) is the simply connected subset of the plane that lies between any three mutually…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Antimatroid
Convex hull
Convex set
Discrete & Computational Geometry
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Simple crystallizations of 4-manifolds
Biplab Basak
,
J. Spreer
2014
Corpus ID: 118365697
Minimal crystallizations of simply connected PL 4-manifolds are very natural objects. Many of their topological features are…
Expand
2013
2013
Minimal Crystallizations of 3-Manifolds
Biplab Basak
,
B. Datta
Electronic Journal of Combinatorics
2013
Corpus ID: 2944642
We have introduced the weight of a group which has a presentation with number of relations is at most the number of generators…
Expand
2013
2013
A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations
V. Álvarez
,
K. Bringmann
,
Saurabh Ray
arXiv.org
2013
Corpus ID: 10898679
Let P ⊂ R 2 be a set of n points. In [1] and [2] an algorithm for counting triangulations and pseudo-triangulations of P…
Expand
2010
2010
Compatible pointed pseudo-triangulations
T. Hackl
,
O. Aichholzer
,
B. Vogtenhuber
Canadian Conference on Computational Geometry
2010
Corpus ID: 3001183
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show…
Expand
2008
2008
Minimum Weight Convex Steiner Partitions
A. Dumitrescu
,
Csaba D. Tóth
ACM-SIAM Symposium on Discrete Algorithms
2008
Corpus ID: 14118567
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and…
Expand
2006
2006
The Existence of a Pseudo-triangulation in a given Geometric Graph
A. Schulz
2006
Corpus ID: 9947714
We show that the problem of deciding if a pseudotriangulation is contained inside a geometric graph is NP-complete. For this we…
Expand
2005
2005
Generative Model for Layers of Appearance and Deformation
A. Kannan
,
N. Jojic
,
B. Frey
International Conference on Artificial…
2005
Corpus ID: 1243584
We are interested in learning generative models of objects that can be used in wide range of tasks such as video summarization…
Expand
2001
2001
Diagonal flips in pseudo-triangulations on closed surfaces
Seiya Negami
Discrete Mathematics
2001
Corpus ID: 11121216
1998
1998
On polygonal covers
M. Pocchiola
,
G. Vegter
1998
Corpus ID: 126026098
A polygonal cover of a nite collection of pairwise disjoint convex compact sets in the plane is a nite collection of non…
Expand
1990
1990
Sensitivity of the pose refinement problem to accurate estimation of camera parameters
Rakesh Kumar
,
A. Hanson
[] Proceedings Third International Conference on…
1990
Corpus ID: 41973386
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…
Expand
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)
ACCEPT & CONTINUE