Emerging experimental platforms use amorphousness, a constrained form of disorder, to
tailor meta-material properties. We study localization under this type of disorder in a class of …

A pseudo-triangle is a simple polygon with exactly three convex vertices, and all other
vertices (if any) are distributed on three concave chains. A pseudo-triangulation~ $\mathcal …

Deciding 3-colorability for general plane graphs is known to be an NP-complete problem.
However, for certain families of graphs, like triangulations, polynomial time algorithms exist …

A tri-quadrangulation is a connected simple plane graph with each face either triangular or
quadrangular. Recently, Aichholzer et al.(2014) proved that any two tri-quadrangulations …

A perfect straight-line matching $ M $ on a finite set $ P $ of points in the plane is a set of
segments such that each point in $ P $ is an endpoint of exactly one segment. $ M $ is non …

A pseudo-triangle is a simple polygon with exactly three convex vertices. A pseudo-
triangulation T of a point set P in R 2 is a partitioning of the convex hull of P into pseudo …

In this thesis we consider several related topics in the field of computational geometry. We
are concerned with algorithmic problems fully determined by the order type of a point set …

Todo el mundo conoce la noción de triangulación para un conjunto de puntos en el plano.
Esta estructura puede generalizarse mediante el concepto de pseudo-triangulación. Tanto …

A Bibliography of Publications in International Journal of Computational Geometry and
Applications Page 1 A Bibliography of Publications in International Journal of Computational …