The construction of a minimum-width annulus of a set of objects in the plane has useful applications in diverse fields, such as tolerancing metrology and facility location. We present a novel implementation of an algorithm for obtaining a minimum-width annulus containing a given set of disks in the plane, in case one exists. The algorithm extends previously known methods for constructing minimu...

(a) If one wants to de ne the locus where p is further away than all other points, i.e., strictly the farthest point, consider the following: As h(p, p ) := {x 2 R | d(x, p) < d(x, p )} denotes the open halfplane of all points that are strictly closer to p than to p , h(p , p) is the open halfplane on the other side of the bisector b(p, p ) of p and p that contains all points strictly farther a...

We study the matching characteristics of a rectangular slot located in the farthest upper part of a ground plane. First, we investigate the effect of geometrical parameters including the length and width of the slot, the ground plane height, and feed point position on the input impedance. In turn, we consider the matching between the slot and a 50 feed and examine impedance-matched frequencies ...

We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log n) time per update in Mulmuley’s expected-case model of dynamic geometric computation. We use as subroutines dynamic algorithms for two other geometric graphs: the farthest neighbor forest and the rotating caliper graph related to an algorithm for static computation of point set widths and d...

We propose a metric-learning framework for computing distance-preserving maps that generate low-dimensional embeddings for a certain class of manifolds. We employ Siamese networks to solve the problem of least squares multidimensional scaling for generating mappings that preserve geodesic distances on the manifold. In contrast to previous parametric manifold learning methods we show a substanti...

We fix the status quo (Q) and one of the bilateral bargaining agents to examine how shifting the opponent’s ideal point away from Q in a unidimensional space affects the Nash (NS) and the Kalai-Smorodinsky (KS) bargaining solutions. As anticipated, the bargainer whose ideal point is farthest from Q prefers an opponent whose ideal is closest to his own. On the other hand, the ranking of opponent...

The eccentricity transform associates to each point of a shape the geodesic distance to the point farthest away from it. The transform is defined in any dimension, for simply and non simply connected sets. It is robust to Salt & Pepper noise and is quasi-invariant to articulated motion. Discrete analytical concentric circles with constant thickness and increasing radius pave the 2D plane. An or...

bstract. We integrate stylized rendering with an efficient multiesolution image representation, enabling a user to control how ompression affects the aesthetic appearance of an image. We dopt a point-based rendering approach to progressive image transission and compression. We use a novel, adaptive farthest point ampling algorithm to represent the image at progressive levels of etail, balancing...

Membranes with immobilized GM3-type oligosaccharide were prepared and influenza virus adsorption was evaluated. GM3-type oligosaccharide which has azido group in the aglycon was synthesized by saccharide primer method. The azido group was used for combination by click chemistry with alkyne which is introduced to membranes. The position of the azido group in the aglycon of GM3-type oligosacchari...

In 1960, Klee showed that a subset of a Euclidean space must be a singleton provided that each point in the space has a unique farthest point in the set. This classical result has received much attention; in fact, the Hilbert space version is a famous open problem. In this paper, we consider Klee sets from a new perspective. Rather than measuring distance induced by a norm, we focus on the case...