Results 41 to 50 of about 7,960 (210)
Two triangulations methods based on edge refinement [PDF]
, 2003 In this paper two curvature adaptive methods of surface triangulation are presented. Both methods are based on edge refinement to obtain a triangulation compatible with the curvature requirements.
Ayala Vallespí, M. Dolors +2 more
core +1 more source
Anisotropic Mesh Adaptation for Image Representation [PDF]
, 2016 Triangular meshes have gained much interest in image representation and have been widely used in image processing. This paper introduces a framework of anisotropic mesh adaptation (AMA) methods to image representation and proposes a GPRAMA method that is
Li, Xianping
core +2 more sources
Solving for Blameless and Optimal Control Under Prioritized Safety Constraints
Optimal Control Applications and Methods, EarlyView.Summary of the proposed method for solving for blameless and optimal control sequences. ABSTRACT In many safety‐critical optimal control problems, users may request multiple safety constraints that are jointly infeasible due to external factors such as subsystem failures, unexpected disturbances, or fuel limitations.
Natalia Pavlasek +3 more
wiley +1 more source
ComputationWe propose a method for generating a constrained Delaunay triangulation CDT applied to labeled 2D images with high morphological complexity. In the previous paper, Part 1, we established an unbiased planar straight-line graph (PLSG) on image objects of ...
F. N’Guyen, T. Kanit, A. Imad
doaj +1 more source
Continuous Scale Transformations of Linear Features Using Simulated Annealing-Based Morphing
ISPRS International Journal of Geo-Information, 2017 This paper presents a new method for use in performing continuous scale transformations of linear features using Simulated Annealing-Based Morphing (SABM).
Jingzhong Li +3 more
doaj +1 more source
Annals of the Academy of Romanian Scientists Series on Mathematics and Its Application, 2020 "In this paper we present an edge swapping approach for incorporating line segments into triangulation. If the initial triangulation is Delaunay, the algorithm tends to produce optimal Constrained Delaunay triangulation by improving the triangles’ aspect ratios from the local area being constrained.
Bozhidar Angelov Stanchev +1 more
openaire +1 more source
YOLO‐GDCNN: Real‐Time Operating Point Detection for Live Working Robots in the Power Industry
High Voltage, EarlyView.ABSTRACT In the power industry maintenance, the capability of live working robots to detect and operate with power components in real time is paramount. This paper proposes a cascaded detection framework for real‐time detection of live working operation points, named YOLO‐GDCNN. The framework consists of two parts.
Haoning Zhao +7 more
wiley +1 more source
Fast segment insertion and incremental construction of constrained Delaunay triangulations [PDF]
Computational Geometry, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shewchuk, Jonathan Richard +1 more
openaire +2 more sources
Real‐Time Conformal Maps and Parameterizations
Computer Graphics Forum, EarlyView.Abstract We present a simple algorithm to conformally map between two simple and bounded planar domains based on the concept of harmonic measure, which is a conformal invariant. With suitable preprocessing, the algorithm is fast enough to compute all possible conformal maps (having three real degrees of freedom) between the two domains in real time in
Q. Chang, C. Gotsman, K. Hormann
wiley +1 more source
I/O-Efficient Construction of Constrained Delaunay Triangulations [PDF]
, 2005 In this paper, we designed and implemented an I/O-efficient algorithm for constructing constrained Delaunay triangulations. If the number of constraining segments is smaller than the memory size, our algorithm runs in expected $O(\frac{N}{B}{\rm log}_{M/B}\frac{N}{B})$ I/Os for triangulating N points in the plane, where M is the memory size and B is ...
Pankaj K. Agarwal, Lars Arge, Ke Yi
openaire +3 more sources