4 citations · 14 across the 16 of their papers we have counts for
5 papers · 1 filter
The largest angle bisection procedure
Dan Ismailescu, Joehyun Kim, Kelvin Kim +1
The {\it largest angle bisection} procedure is the operation which partitions a given triangle, , into two smaller triangles by constructing the angle bisector of the largest an…
Grid dissections of tangential quadrilaterals
Erica Choi, Dan Ismailescu, Jiho Lee +1
For any integer , a square can be partitioned into smaller squares via a checkerboard-type dissection. Does there such a class-preserving grid dissection exist for so…
Dense Packings with Nonparallel Cylinders
Dan Ismailescu, Piotr Laskawiec
A \emph{cylinder packing} is a family of congruent infinite circular cylinders with mutually disjoint interiors in -dimensional Euclidean space. The \emph{local density} of a cy…
On the Euclidean dimension of graphs
Jin Hyup Hong, Dan Ismailescu
The Euclidean dimension a graph is defined to be the smallest integer such that the vertices of can be located in in such a way that two vertices are uni…
Area Problems Involving Kasner Polygons
Dan Ismailescu, Minsuk Kim, Kyung Jae Lee +2
Sequences of polygons generated by performing iterative processes on an initial polygon have been studied extensively. One of the most popular sequences is the one sometimes referr…