Aloupis, G., and others 1 Algorithms for Computing Geometric Measures of Melodic Similarity (2008)
Greg Aloupis, Thomas Fevens, Antonio Mesa, Yurai Nuñez, Stefan Langerman, Tomomi Matsui, ...
We have all heard numerous melodies, whether they come from commercial jingles, jazz ballads, operatic aria, or any of a variety of different sources. How a human detects similarities in melodies has...
Abstract Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks (2008)
George Kao, Thomas Fevens, Jaroslav Opatrny
A unit disk graph and its proximity graphs are often used as the underlying topologies of a mobile ad hoc network. One category of unicast routing algorithms, position-based routing algorithms, has...
Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa
Rappaport k Godfried Toussaint \Lambda Abstract Consider two orthogonal closed chains on a cylinder. The chains are monotone with respect to the angle \Theta. We wish to rigidly move one chain so...
Simple Polygons that Cannot be Deflated (2007)
Thomas Fevens Mcgill, Thomas Fevens, Antonio Hernandez, Michael Soss
Given a simple polygon in the plane, a deflation is defined as the inverse of a flip in the Erdos-Nagy sense. In 1993 Bernd Wegner conjectured that every simple polygon admits only a finite number of...
Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Godfried Toussaint
Consider two orthogonal closed chains on a cylinder. The chains are monotone with respect to the angle . We wish to rigidly move one chain so that the total area between the two chains is minimized....
Algorithms for Computing Geometric Measures of Melodic Similarity (2006)
Aloupis, Greg., Fevens, Thomas., Langerman, Stefan., Mesa, Antonio., Nunez, Yurai., ...
Computer Music Journal - Volume 30, Number 3, Fall 2006
Algorithms for Computing Geometric Measures of Melodic Similarity ∗ (2004)
Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Nuñez, ...
Consider two orthogonal closed chains on a cylinder. These chains are monotone with respect to the tangential Θ direction. We wish to rigidly move one chain so that the total area between the two is...
Computing a geometric measure of the similarity between two melodies (2003)
Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Nuñez, ...
Consider two orthogonal closed chains on a cylinder. The chains are monotone with respect to the angle Θ. We wish to rigidly move one chain so that the total area between the two chains is...
Computing a Geometric Measure of the Similarity between two Melodies (2003)
Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Nunez, ...
Consider two orthogonal closed chains on a cylinder. The chains are monotone with respect to the angle . We wish to rigidly move one chain so that the total area between the two chains is minimized....
Simple Polygons with an Infinite Sequence of Deflations (2001)
Thomas Fevens, Antonio Hernandez, Antonio Mesa, Patrick Morin, Michael Soss
Given a simple polygon in the plane, a deflation is defined as the inverse of a flip in the Erdos-Nagy sense. In 1993 Bernd Wegner conjectured that every simple polygon admits only a finite number of...
Minimum Convex K-Partitions of a Linearly Constrained Point Set (1999)
Thomas Fevens, Henk Meijer, David Rappaport
We present an optimization algorithm to determine a partition of the convex hull of a finite set of ponts in the plane. The partition uses the points as corners of convex polygonal cells, each cell...
Minimum Convex Partition of a Constrained Point Set (1998)
Thomas Fevens, Henk Meijer, David Rappaport
: A convex partition with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the boundary of the convex hull of S,...
Minimum Weight Convex Quadrangulation of a Constrained Point Set (1997)
Thomas Fevens, Henk Meijer, David Rappaport
Summary: A convex quadrangulation with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the boundary of the...
Minimum Weight Convex Quadrangulation of a Constrained Point Set (1997)
Thomas Fevens, Henk Meijer, David Rappaport
A convex quadrangulation with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the boundary of the convex hull of...
Minimum Weight Convex Quadrangulation of a Constrained Point Set (1997)
Thomas Fevens, Henk Meijer, David Rappaport
1 Introduction There are many problems for which it is necessary to find a numerical solution of a complicated system of differential equations. To find such a numerical solution, the finite element...
Absorbing Boundary Conditions for the Schrödinger Equation (1996)
. A large number of differential equation problems which admit traveling waves have very large (typically infinite) naturally defined domains, with boundary conditions defined at the domain boundary....
Absorbing Boundary Conditions for the Schrödinger Equation (1996)
Thomas Fevens, Thomas Fevens, Hong Jiang, Hong Jiang
. A large number of differential equation problems which admit traveling waves are usually defined in very large or infinite domains. To be able to numerically solve these problems in smaller...
Absorbing Boundary Conditions for the Schrödinger Equation (1996)
Thomas Fevens, Thomas Fevens, Hong Jiang, Hong Jiang
A large number of differential equation problems which admit traveling waves have very large (typically infinite) naturally defined domains, with boundary conditions defined at the domain boundary....
Absorbing Boundary Conditions for the Schrödinger Equation (1996)
Thomas Fevens, Thomas Fevens, Hong Jiang, Hong Jiang
. A large number of differential equation problems which admit traveling waves are usually defined in very large of infinite domains. To be able to numerically solve these problems in smaller...
Absorbing boundary conditions for the Schrodinger equation (1995)
Abstract. A large number of di#erential equation problems which admit traveling waves are usually defined on very large or infinite domains. To numerically solve these problems on smaller subdomains...
Absorbing Boundary Conditions for the Schrödinger Equation (1995)
. A large number of differential equation problems which admit traveling waves have very large (typically infinite) naturally defined domains, with boundary conditions defined at the domain boundary....
Absorbing boundary conditions for the Schrodinger equation (1995)
Abstract. A large number of di erential equation problems which admit traveling waves have very large (typically in nite) naturally de ned domains, with boundary conditions de ned at the domain...