Add to ORKGAbstract. Given a convex quadrilateral Q having a certain property P, we are interested in finding a dissection of Q into a finite number of smaller convex quadrilaterals, each of which has property P as well. In particular, we prove that every cyclic, orthodiagonal, or circumscribed quadrilateral can be dissected into cyclic, orthodiagonal, or circumscribed quadrilaterals, respectively. The problem becomes much more interesting if we restrict our study to a particular type of partition we call grid dissection. 1
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
Given a set S such as a polygon or a set of points, a quadrangulation of S is a partition of the int...
2021 Fall.Includes bibliographical references.A convex polyhedron is the convex hull of a finite set...
[[abstract]]The algorithm to construct the convex hull for a set of finite points in two-dimensional...
In this article we will give a positive answer to a recent conjecture on orthic quadrilaterals: If a...
In this article we will give a positive answer to a recent conjecture on orthic quadrilaterals: If a...
In this article we will give a positive answer to a recent conjecture on orthic quadrilaterals: If a...
In this article we will give a positive answer to a recent conjecture on orthic quadrilaterals: If a...
AbstractFor a given planar point set P, consider a partition of P into disjoint convex polygons. In ...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
Classical dissections convert any planar polygonal region onto any other polygonal region having th...
Classical dissections convert any planar polygonal region onto any other polygonal region having th...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
Given a set S such as a polygon or a set of points, a quadrangulation of S is a partition of the int...
2021 Fall.Includes bibliographical references.A convex polyhedron is the convex hull of a finite set...
[[abstract]]The algorithm to construct the convex hull for a set of finite points in two-dimensional...
In this article we will give a positive answer to a recent conjecture on orthic quadrilaterals: If a...
In this article we will give a positive answer to a recent conjecture on orthic quadrilaterals: If a...
In this article we will give a positive answer to a recent conjecture on orthic quadrilaterals: If a...
In this article we will give a positive answer to a recent conjecture on orthic quadrilaterals: If a...
AbstractFor a given planar point set P, consider a partition of P into disjoint convex polygons. In ...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
Classical dissections convert any planar polygonal region onto any other polygonal region having th...
Classical dissections convert any planar polygonal region onto any other polygonal region having th...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...