Searching for authors named "Thomas Fevens" – sorted by Relevance.
9 documents found, showing 1 through 9.
-
Absorbing Boundary Conditions for the Schrödinger Equation
- …A large number of differential equation problems which admit traveling waves are usually defined on very large or infinite domains. To numerically solve these problems on smaller subdomains of the original domain, artificial boundary conditions must be defined for these subdomains. One type of artif…
- Cited by 1 (0 self) – Add To MetaCart
-
Simple Polygons that Cannot be Deflated
- …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 deflations. In this note we describe a counter-example to this conjecture by exhibiting a family…
- Add To MetaCart
-
unknown title
- …Partitioning a regular n-gon into n + 1 congruent pieces is impossible for sufficiently large n…
- Add To MetaCart
-
Minimum Convex K-Partitions of a Linearly Constrained Point Set
- …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 having at most K sides. We minimize the total number of cells that are obtained. The algorithm runs…
- Add To MetaCart
-
Minimum Convex Partition of a Constrained Point Set
- …: 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, and every bounded interior face is a convex polygon. A minimum convex partition with respect to S is …
- Cited by 9 (1 self) – Add To MetaCart
-
Minimum Weight Convex Quadrangulation of a Constrained Point Set
- …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 convex hull of S, and every bounded interior face is convex and has four points from S on its boundary. A …
- Cited by 1 (1 self) – Add To MetaCart
-
Simple Polygons with an Infinite Sequence of Deflations
- …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 deflations.…
- Cited by 5 (0 self) – Add To MetaCart
-
unknown title
- …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 that the totalarea between the two chains is minimized. This is a geometric measure of similarity between two repeatingmelodies proposed by 'O M…
- Add To MetaCart
-
Computing a Geometric Measure of the Similarity Between two Melodies
- …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...…
- Cited by 5 (5 self) – Add To MetaCart
Showing 1 through 9.
