Topic
Piecewise linear function
About: Piecewise linear function is a research topic. Over the lifetime, 8133 publications have been published within this topic receiving 161444 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this paper, a finite element approximation of the minimal surface problem for a strictly convex bounded plane domain Q2 is considered, and the approximating functions are continuous and piecewise linear on a triangulation of Q2.
Abstract: A finite element approximation of the minimal surface problem for a strictly convex bounded plane domain Q2 is considered. The approximating functions are continuous and piecewise linear on a triangulation of Q2. Error estimates of the form 0(h) in the H1 norm and 0(h 2) in the Lp-norm (p < 2) are proved,where h denotes the maximal side in the triangulation.
55 citations
TL;DR: This work proposes a greedy strategy based on randomized and thermal variants of the classical Agmon-Motzkin-Schoenberg relaxation method for solving systems of linear inequalities and provides good approximate solutions in a short amount of time.
55 citations
01 Aug 1989-Graphical Models \/graphical Models and Image Processing \/computer Vision, Graphics, and Image Processing
TL;DR: A new representation of a closed 2D shape a cyclic sequence of the extended circular images of the convex and concave segments of its contour is introduced, which is used to establish correspondences between segments of the two contours using dynamic programming.
Abstract: Shape matching is a fundamental problem of vision in general and interpretation of deforming shapes in particular. The objective of matching in this instance is to recover the deformation and therefore generalizes the notion of correlation, which aims to only produce a numerical measure of the similarity between two shapes. To address shape matching, we introduce a new representation of a closed 2D shape a cyclic sequence of the extended circular images of the convex and concave segments of its contour. This representation is then used to establish correspondences between segments of the two contours using dynamic programming. Finally, we compute a recovery of the differences between two similar contours in terms of the action of curvature process. Computation of convex and concave segments of the contours, given in piecewise linear form, is accomplished using the analytic representation of a local B-spline fit. We show the result of our deformation recovery scheme appliedto dynamic cloud silhouette analysis using hand-traced input from real satellite images.
55 citations
TL;DR: In this article, a comprehensive optimal design solution for piecewise-linear vibration isolation systems is presented, where the primary suspension optimum parameters are established, followed by an investigation of jump-avoidance conditions for the secondary suspension within the no-jump zones.
55 citations
01 Jul 1993
TL;DR: An approach toward path-oriented timing-driven placement is proposed, which first transforms the placement with timing constraints to a Lagrange problem, and a primal-dual approach is used to find the optimal relative module locations.
Abstract: An approach toward path-oriented timing-driven placement is proposed. We first transform the placement with timing constraints to a Lagrange problem. A primal-dual approach is used to find the optimal relative module locations. In each primal dual iteration, the primal problem is solved by a piecewise linear resistive network method, while the dual process is used to update the Lagrange multiplier. The sparsity of the piecewise linear resistive network is exploited to obtain dramatic improvement on the efficiency of the calculation. Up to 22.0% of clock cycle reduction was observed for Primary2 test case.
55 citations