Douglas J. LaFountain
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Douglas J. LaFountain has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Dinesh B. Ekanayake
Western Illinois Univ, 1 Univ Cir, Macomb, IL 61455 USA
2 shared publications - Robert C. Penner
Center for the Topology and Quantization of Moduli Spaces and Dept. of Math., Aarhus Univ., Aarhus, Denmark; Depts. of Math. and Physics, Caltech, Pasadena, Calif., USA; and the Erwin Schrödinger Int’l Institute for Mathematical Physics, Vienna, Austria
2 shared publications - Boris Petracovici
Western Illinois Univ, 1 Univ Cir, Macomb, IL 61455 USA
1 shared publication - Hamed Karami
Department of Mathematics & Statistics, Georgia State University, Atlanta, USA
1 shared publication - Manjula Mahesh Ranpatidewage
Western Illinois Univ, 1 Univ Cir, Macomb, IL 61455 USA
1 shared publication - Mokhtar Aouina1 shared publication
Latest Publications
- Open Access
Distance-balancing of cube-connected cycles graphs
We show that cube-connected cycles graphs $CCC_n$ are distance-balanced, and nicely distance-balanced if and only if $n$ is even.Open AccessDistance-balancing of cube-connected cycles graphs
We show that cube-connected cycles graphs $CCC_n$ are distance-balanced, and nicely distance-balanced if and only if $n$ is even. - 1 August 2023
- Published by Institute of Mathematics, Czech Academy of Sciences in Applications of Mathematics
- Vol. 68 (4) , 387-404
Finite convergence into a convex polytope via facet reflections
The problem of utilizing facet reflections to bring a point outside of a convex polytope to inside has not been studied explicitly in the literature. Here we introduce two algorithms that complete the task in finite iterations. The first algorithm generates multiple solutions on the plane, and can be readily utilized in creating games on a plane or as a level generation method for video games. The second algorithm is a new efficient way to bring infeasible starting points of an optimization problem to inside a feasible region defined by constraints. Using simulations, we demonstrate many desirable properties of the algorithm. Specifically, more edges do not lead to more iterations in Double-struck capital R-2, the algorithm is extremely efficient in high dimensions, and it can be employed to discretize the feasibility region using a grid of points outside the region.
- 1 August 2023
- Published by Institute of Mathematics, Czech Academy of Sciences in Applications of Mathematics
- Vol. 68 (4) , 387-404
Finite convergence into a convex polytope via facet reflections
The problem of utilizing facet reflections to bring a point outside of a convex polytope to inside has not been studied explicitly in the literature. Here we introduce two algorithms that complete the task in finite iterations. The first algorithm generates multiple solutions on the plane, and can be readily utilized in creating games on a plane or as a level generation method for video games. The second algorithm is a new efficient way to bring infeasible starting points of an optimization problem to inside a feasible region defined by constraints. Using simulations, we demonstrate many desirable properties of the algorithm. Specifically, more edges do not lead to more iterations in Double-struck capital R-2, the algorithm is extremely efficient in high dimensions, and it can be employed to discretize the feasibility region using a grid of points outside the region.
- 1 February 2020
- Published by Institute of Mathematics, Czech Academy of Sciences in Applications of Mathematics
- Vol. 65 (1) , 1-22
Optimal Packings for Filled Rings of Circles
General circle packings are arrangements of circles on a given surface such that no two circles overlap except at tangent points. In this paper, we examine the optimal arrangement of circles centered on concentric annuli, in what we term rings. Our motivation for this is two-fold: first, certain industrial applications of circle packing naturally allow for filled rings of circles; second, any packing of circles within a circle admits a ring structure if one allows for irregular spacing of circles along each ring. As a result, the optimization problem discussed herein will be extended in a subsequent paper to a more general setting. With this framework in mind, we present properties of concentric rings that have common points of tangency, the exact solution for the optimal arrangement of filled rings along with its symmetry group, and applications to construction of aluminum-conductor steel reinforced cables.
- 1 February 2020
- Published by Institute of Mathematics, Czech Academy of Sciences in Applications of Mathematics
- Vol. 65 (1) , 1-22
Optimal Packings for Filled Rings of Circles
General circle packings are arrangements of circles on a given surface such that no two circles overlap except at tangent points. In this paper, we examine the optimal arrangement of circles centered on concentric annuli, in what we term rings. Our motivation for this is two-fold: first, certain industrial applications of circle packing naturally allow for filled rings of circles; second, any packing of circles within a circle admits a ring structure if one allows for irregular spacing of circles along each ring. As a result, the optimization problem discussed herein will be extended in a subsequent paper to a more general setting. With this framework in mind, we present properties of concentric rings that have common points of tangency, the exact solution for the optimal arrangement of filled rings along with its symmetry group, and applications to construction of aluminum-conductor steel reinforced cables.
- Open Access
Filtered screens and augmented Teichmüller space
We study a new bordification of the decorated Teichm\"uller space for a multiply punctured surface F by a space of filtered screens on the surface that arises from a natural elaboration of earlier work of McShane-Penner. We identify necessary and sufficient conditions for paths in this space of filtered screens to yield short curves having vanishing length in the underlying surface F. As a result, an appropriate quotient of this space of filtered screens on F yields a decorated augmented Teichm\"uller space which is shown to admit a CW decomposition that naturally projects to the augmented Teichm\"uller space by forgetting decorations and whose strata are indexed by a new object termed partially oriented stratum graphs.
Open AccessFiltered screens and augmented Teichmüller space
We study a new bordification of the decorated Teichm\"uller space for a multiply punctured surface F by a space of filtered screens on the surface that arises from a natural elaboration of earlier work of McShane-Penner. We identify necessary and sufficient conditions for paths in this space of filtered screens to yield short curves having vanishing length in the underlying surface F. As a result, an appropriate quotient of this space of filtered screens on F yields a decorated augmented Teichm\"uller space which is shown to admit a CW decomposition that naturally projects to the augmented Teichm\"uller space by forgetting decorations and whose strata are indexed by a new object termed partially oriented stratum graphs.
- 23 May 2015
- Published by Springer Nature in Geometriae Dedicata
- Vol. 179 (1) , 303-333
Filtered screens and augmented Teichmüller space
- 23 May 2015
- Published by Springer Nature in Geometriae Dedicata
- Vol. 179 (1) , 303-333
Filtered screens and augmented Teichmüller space
- Open Access
Embedded annuli and Jones' conjecture
We show that after stabilizations of opposite parity and braid isotopy, any two braids in the same topological link type cobound embedded annuli. We use this to prove the generalized Jones conjecture relating the braid index and algebraic length of closed braids within a link type, following a reformulation of the problem by Kawamuro.
Open AccessEmbedded annuli and Jones' conjecture
We show that after stabilizations of opposite parity and braid isotopy, any two braids in the same topological link type cobound embedded annuli. We use this to prove the generalized Jones conjecture relating the braid index and algebraic length of closed braids within a link type, following a reformulation of the problem by Kawamuro.