finding a cost-optimal path in a weighted planar polygonal subdivision. Searching for paths on a grid representation of the scene is fast and easy to implement. However, grid representations do not capture the exact geometry of the scene. Hence, grid paths can be inaccurate or might not even exist at all. Methods that work on an exact representation of the scene can approximate an optimal path ...

The goal of 3D surface simplification is to reduce the storage cost of 3Dmodels. A 3D animation model typically consists of several 3D models. Therefore, to ensure that animation models are realistic, numerous triangles are often required. However, animation models that have a high storage cost have a substantial computational cost. Hence, surface simplification methods are adopted to reduce th...

We consider a market in which capacity-constrained generators compete in scalar-parameterized supply functions to servean inelastic demand spread throughout a transmission constrained power network. The market clears according to a locationalmarginal pricing mechanism, in which the independent system operator (ISO) determines the generators’ production quantities tominimize the reve...

The Weighted Region Problem is defined as the problem of finding a cost-optimal path in a weighted planar polygonal subdivision. Searching for paths on a grid representation of the scene is fast and easy to implement. However, grid representations do not capture the exact geometry of the scene. Hence, grid paths can be inaccurate or might not even exist at all. Methods that work on an exact rep...

A weighted coloured–edge graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such a graph paths are compared by their total weight in each colour, resulting in a Pareto set of minimal paths from one vertex to another. This paper will give ...

It has been previously shown how mirrors can be used to capture stereo images with a single camera, an approach termed catadioptric stereo. In this paper, we present novel catadioptric sensors that use mirrors to produce rectified stereo images. The scanline correspondence of these images benefits real-time stereo by avoiding the computational cost and image degradation due to resampling when r...

It has been considered that the task of parsing represents a high computational cost in Natural Language Processing (PLN), for this reason its application to several tasks has been limited. One of these is the authorship attribution of texts (AAT), which is responsible for answering the question of who is the author of a text, giving some previous examples of that author (training set). In spit...

We present several mesh smoothing schemes based on the concept of optimal Delaunay triangulations. We define the optimal Delaunay triangulation (ODT) as the triangulation that minimizes the interpolation error among all triangulations with the same number of vertices. ODTs aim to equidistribute the edge length under a new metric related to the Hessian matrix of the approximated function. Theref...

This paper provides an overview of power line communication (PLC) applications, challenges and possible evolution. Emphasis is put on two relevant aspects: a) channel characterization and modeling, b) filter bank modulation for spectral efficient transmission. The main characteristics of both the indoor channel (in-home, in-ship, in-car) and the outdoor low voltage and medium voltage channels a...

Although a pilot national live-donor kidney exchange program was recently launched in the US, the kidney shortage is increasing faster than ever. A new solution paradigm is able to incorporate compatible pairs in exchange. In this paper, we consider an exchange framework that has both compatible and incompatible pairs, and patients are indifferent over compatible pairs. Only two-way exchanges a...