Journal articles: 'Polyglot programming'

1

Velbitsky, I. V. "Smart visual 3D+ polyglot-concept of programming without programming languages." System research and information technologies, no. 3 (September 29, 2017): 88–106. http://dx.doi.org/10.20535/srit.2308-8893.2017.3.09.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Nowak, Robert M. "Polyglot Programming in Applications Used for Genetic Data Analysis." BioMed Research International 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/253013.

Full text

Abstract:

Applications used for the analysis of genetic data process large volumes of data with complex algorithms. High performance, flexibility, and a user interface with a web browser are required by these solutions, which can be achieved by using multiple programming languages. In this study, I developed a freely available framework for building software to analyze genetic data, which uses C++, Python, JavaScript, and several libraries. This system was used to build a number of genetic data processing applications and it reduced the time and costs of development.

APA, Harvard, Vancouver, ISO, and other styles

3

Nuris Dwi Setiawan, Bagus Sudirman, and Sigit Umar Anggono. "IMPACT OF EMBEDDED CLS ON EYE TRACKING REPLICATION." Journal of Technology Informatics and Engineering 1, no. 3 (December 22, 2022): 33–48. http://dx.doi.org/10.51903/jtie.v1i3.148.

Full text

Abstract:

Using different programming languages when software advancement is a familiar method in current software advancement. Nevertheless, using various languages that can hinder developer capacity is not widely known. This research simulated an unplanned controlled study examining the adoption of various languages in the situation of a directory programming task. Participants in this study were given programming tasks written in Java and one of three SQL-like embedded languages. Simple “SQL” over authority, “Java” program only, and a more Java-like hybrid embedded language. Furthermore, to transcribe the responses to the online quest and the participators' “task” solutions, the participators' eye movements were also recorded with an eye tracker. “Eye Tracker” or in this study call as “Eye-Trc” is the methodology of the study of software development that has developed nowadays and grants more in-depth info about how developers accomplish programming tasks. This Eye-Trc method is used as a data collection method in this study. Eye-Trc data was get by thirty-one participators (university background and Industrial Background) for different programming tasks. To analyze the impact of inter-group inconstant and professional experience and in-group “task” variables on the dependent variable Time in completion, this study used a mixed model ANOVA. The outcome of this study indicates that an important impact on productivity was not found, this is different from the initial research because of the language used. However, the same effect was found from the participators' expertise in programming activity indicating that more competent programmers were easy to full fill “polyglot programming tasks” more efficiently. In addition, it was raised that participators viewed the specimen code with the same proportion (time) for bringing “task” reckless of skills or language alternative provided. dominant-stage exploration management also remains mostly consistent over the experiences or language alternatives. Overall, it can be concluded that the programming stage of the linguist doesn’t have an important impact. The top-stage strategies that participators used came to be identical reckless of the language alternative presented to them. As a suggestion for future research, the impact of various characteristics of polyglot programming languages should be studied in depth for the conclusions reached to remain correct across various polyglot programming contexts.

APA, Harvard, Vancouver, ISO, and other styles

4

Grulich, Philipp Marian, Steffen Zeuch, and Volker Markl. "Babelfish." Proceedings of the VLDB Endowment 15, no. 2 (October 2021): 196–210. http://dx.doi.org/10.14778/3489496.3489501.

Full text

Abstract:

Today's users of data processing systems come from different domains, have different levels of expertise, and prefer different programming languages. As a result, analytical workload requirements shifted from relational to polyglot queries involving user-defined functions (UDFs). Although some data processing systems support polyglot queries, they often embed third-party language runtimes. This embedding induces a high performance overhead, as it causes additional data materialization between execution engines. In this paper, we present Babelfish, a novel data processing engine designed for polyglot queries. Babelfish introduces an intermediate representation that unifies queries from different implementation languages. This enables new, holistic optimizations across operator and language boundaries, e.g., operator fusion and workload specialization. As a result, Babelfish avoids data transfers and enables efficient utilization of hardware resources. Our evaluation shows that Babelfish outperforms state-of-the-art data processing systems by up to one order of magnitude and reaches the performance of handwritten code. With Babelfish, we bridge the performance gap between relational and multi-language UDFs and lay the foundation for the efficient execution of future polyglot workloads.

APA, Harvard, Vancouver, ISO, and other styles

5

Schiavio, Filippo, Daniele Bonetta, and Walter Binder. "Language-agnostic integrated queries in a managed polyglot runtime." Proceedings of the VLDB Endowment 14, no. 8 (April 2021): 1414–26. http://dx.doi.org/10.14778/3457390.3457405.

Full text

Abstract:

Language-integrated query (LINQ) frameworks offer a convenient programming abstraction for processing in-memory collections of data, allowing developers to concisely express declarative queries using general-purpose programming languages. Existing LINQ frameworks rely on the well-defined type system of statically-typed languages such as C # or Java to perform query compilation and execution. As a consequence of this design, they do not support dynamic languages such as Python, R, or JavaScript. Such languages are however very popular among data scientists, who would certainly benefit from LINQ frameworks in data analytics applications. In this work we bridge the gap between dynamic languages and LINQ frameworks. We introduce DynQ, a novel query engine designed for dynamic languages. DynQ is language-agnostic, since it is able to execute SQL queries in a polyglot language runtime. Moreover, DynQ can execute queries combining data from multiple sources, namely in-memory object collections as well as on-file data and external database systems. Our evaluation of DynQ shows performance comparable with equivalent hand-optimized code, and in line with common data-processing libraries and embedded databases, making DynQ an appealing query engine for standalone analytics applications and for data-intensive server-side workloads.

APA, Harvard, Vancouver, ISO, and other styles

6

Velbitsky, Igor. "Programming without Programming Languages (New Graphic Poliglot Сoncept)." Application and Theory of Computer Technology 2, no. 2 (February 28, 2017): 26. http://dx.doi.org/10.22496/atct20170124135.

Full text

Abstract:

For the first time since 1947 it is proposed to use a simpler and mathematically more rigorous concept of programming with the graphs loaded only through horizontal arcs with characters, functions and expressions of elementary mathematics. Such graph is a polyglot, it has ISO 8631/1989 standard, and is the only one that can be used effectively throughout the life cycle of program design and use. Conventional programming languages are not needed. The new concept has 100+ times better characteristics with regard to visualization, simplicity, and compactness, as well as the speed of entering into the computer. Processes of error-free design of algorithms, programs, and data structures, evidence of their correctness, self-documenting and documenting of motivation of decisions made are significantly simplified, improved and accelerated. The resulting programs are more effective on the memory footprint and execution time. The larger and the more complex is the program project, the greater is the effect of applying the new concept. The new concept is so simple that it makes it possible to program for ANYONE, not just for programmers. We do not know analogue of the new concept. This article describes the history of developing and proving the new concept, its description, advantages, implemented graphical programming environment, and perspectives for its application.

APA, Harvard, Vancouver, ISO, and other styles

7

Justo, David, Shaoqing Yi, Lukas Stadler, Nadia Polikarpova, and Arun Kumar. "Towards a polyglot framework for factorized ML." Proceedings of the VLDB Endowment 14, no. 12 (July 2021): 2918–31. http://dx.doi.org/10.14778/3476311.3476372.

Full text

Abstract:

Optimizing machine learning (ML) workloads on structured data is a key concern for data platforms. One class of optimizations called "factorized ML" helps reduce ML runtimes over multi-table datasets by pushing ML computations down through joins, avoiding the need to materialize such joins. The recent Morpheus system automated factorized ML to any ML algorithm expressible in linear algebra (LA). But all such prior factorized ML/LA stacks are restricted by their chosen programming language (PL) and runtime environment, limiting their reach in emerging industrial data science environments with many PLs (R, Python, etc.) and even cross-PL analytics workflows. Re-implementing Morpheus from scratch in each PL/environment is a massive developability overhead for implementation, testing, and maintenance. We tackle this challenge by proposing a new system architecture, Trinity , to enable factorized LA logic to be written only once and easily reused across many PLs/LA tools in one go . To do this in an extensible and efficient manner without costly data copies, Trinity leverages and extends an emerging industrial polyglot compiler and runtime, Oracle's GraalVM. Trinity enables factorized LA in multiple PLs and even cross-PL workflows. Experiments with real datasets show that Trinity is significantly faster than materialized execution (> 8x speedups in some cases), while being largely competitive to a prior single PL-focused Morpheus stack.

APA, Harvard, Vancouver, ISO, and other styles

8

Binet, Sébastien. "Exploring polyglot software frameworks in ALICE FairMQ and fer." EPJ Web of Conferences 214 (2019): 05032. http://dx.doi.org/10.1051/epjconf/201921405032.

Full text

Abstract:

In order to meet the challenges of the Run 3 data rates and volumes, the ALICE collaboration is merging the online and offline infrastructures into a common framework: ALICE-O2. O2 is based on FairRoot and FairMQ, a message-based, multi-threaded and multi-process control frame-work. In FairMQ, processes (possibly on different machines) exchange data via message queues either through 0MQ or nanomsg. In turn, this enables developers to write their reconstruction or analysis process in whatever language they choose or deem appropriate for the task at hand, as long as that programming language can send and receive data through these message queues. This paper introduces fer, a Go-based toolkit that interoperates with the C++ toolkit FairMQ, to explore the realm of polyglot distributed frameworks.

APA, Harvard, Vancouver, ISO, and other styles

9

Mendhe, Dinesh, Stephanie Bergren, and XinQi Dong. "A Novel Survey Platform in the Age of COVID-19 to Increase Accuracy and Adoptability While Reducing Selection Bias." Innovation in Aging 4, Supplement_1 (December 1, 2020): 931–32. http://dx.doi.org/10.1093/geroni/igaa057.3415.

Full text

Abstract:

Abstract Given the ongoing COVID-19 pandemic, secure and distanced data collection platforms are critical for reaching vulnerable populations. Commonly used electronic data collection systems lack a myriad of critical features, including a modern technology stack, new data encryption and security standards, study workflows, and reporting algorithms. Moreover, these systems do not have multilingual mapping functionalities of survey and consent forms. All of these components ultimately increase selection bias while simultaneously reducing the security and quality of the response data. In order to directly address the aforementioned issues, we have developed a multilingual and highly secure data management platform. Our application is built using stable, tested, and modular programming frameworks and design patterns targeted at accommodating intricately complex structures of polyglot mapping, large volume of data, encryption and granular user authorization. The statistical accuracy along with the multilingual mapping are the core highlights of this system. The multilingual function of this platform has the ability to eliminate selection biases while creating a well-balanced cross-section of society. Modern survey design workflows and validation checks ultimately prevent data loss and help reduce data collection errors. The platform design was initiated in April 1, 2020 and has been pilot tested for use in multilingual populations. The currently active application version of the system is capable of supporting in-person and telephone interviews, emailing survey links to every registered participant, building family tree architecture, and online consent management. This platform also has built-in report functionality. Additional features are being explored to improve study coordination and monitoring.

APA, Harvard, Vancouver, ISO, and other styles

10

Grinde, Roger B., and Tom M. Cavalier. "Containment of a single polygon using mathematical programming." European Journal of Operational Research 92, no. 2 (July 1996): 368–86. http://dx.doi.org/10.1016/0377-2217(94)00279-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Milenkovic, V. J., and K. Daniels. "Translational polygon containment and minimal enclosure using mathematical programming." International Transactions in Operational Research 6, no. 5 (September 1999): 525–54. http://dx.doi.org/10.1111/j.1475-3995.1999.tb00171.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

SASTRY, RAGHU, and N. RANGANATHAN. "PMAC: A POLYGON MATCHING CHIP." International Journal of Pattern Recognition and Artificial Intelligence 09, no. 02 (April 1995): 367–85. http://dx.doi.org/10.1142/s0218001495000171.

Full text

Abstract:

The recognition of polygons in 3-D space is an important task in robot vision. Advances in VLSI technology have now made it possible to implement inexpensive, efficient and very fast custom designs. The authors have earlier proposed a class of VLSI architectures for this computationally intensive task, which makes use of a set of local shape descriptors for polygons which are invariant under affine transformations, i.e. translation, scaling, rotation and orthographic projection from 3-D to any 2-D plane. This paper discusses the design and implementation of PMAC, a prototype for polygon matching, as a custom CMOS VLSI chip. The recognition procedure is based on the matching of edge-length ratios using a simplified version of the dynamic programming procedure commonly employed for string matching. The matching procedure also copes with partial occlusions of polygons. The implemented architecture is systolic and fully utilizes the principles of pipelining and parallelism in order to obtain high speed and throughput.

APA, Harvard, Vancouver, ISO, and other styles

13

ITO, Yasuaki, and Koji NAKANO. "A GPU Implementation of Dynamic Programming for the Optimal Polygon Triangulation." IEICE Transactions on Information and Systems E96.D, no. 12 (2013): 2596–603. http://dx.doi.org/10.1587/transinf.e96.d.2596.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Morey, Jim. "Programming in Polygon R&D: Explorations with a Spatial Language." International Journal of Computers for Mathematical Learning 12, no. 1 (February 13, 2007): 85. http://dx.doi.org/10.1007/s10758-006-9108-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Asaeedi, Saeed, Farzad Didehvar, and Ali Mohades. "NLP Formulation for Polygon Optimization Problems." Mathematics 7, no. 1 (December 27, 2018): 24. http://dx.doi.org/10.3390/math7010024.

Full text

Abstract:

In this paper, we generalize the problems of finding simple polygons with minimum area, maximum perimeter, and maximum number of vertices, so that they contain a given set of points and their angles are bounded by α + π where α ( 0 ≤ α ≤ π ) is a parameter. We also consider the maximum angle of each possible simple polygon crossing a given set of points, and derive an upper bound for the minimum of these angles. The correspondence between the problems of finding simple polygons with minimum area and maximum number of vertices is investigated from a theoretical perspective. We formulate these three generalized problems as nonlinear programming models, and then present a genetic algorithm to solve them. Finally, the computed solutions are evaluated on several datasets and the results are compared with those from the optimal approach.

APA, Harvard, Vancouver, ISO, and other styles

16

Buna, Abdul Malik I., Bahtiar Senung, and Abdul Rahman Ismail. "Pond Geographic Information System Polygon Geometry Web Based at Pohuwato Regency Office." IJICS (International Journal of Informatics and Computer Science) 5, no. 2 (July 31, 2021): 173. http://dx.doi.org/10.30865/ijics.v5i2.3191.

Full text

Abstract:

The large number of pond owners using land that is already included in protected forest areas and nature reserve areas has made it difficult for officers to obtain information on the tax objects for pond cultivation. Geographical Information System Application for Tambak Web Based Geometry Polygon at the Pohuwato Fisheries Service which is integrated directly with the internet. The goal is to make it easier for the officers and owners of the pond to find out information about the area of the pond and the taxes payable periodically automatically directly from the website. The research method uses the Waterfall method. Take basic activities such as specification, development, validation, and evolution and represent them as different process phases such as requirements specification, software design, implementation, testing and so on. This application will be developed for the desktop with a web-based operating system. There are two programming techniques used, the client side will use Java programming and the server side will use PHP Programing

APA, Harvard, Vancouver, ISO, and other styles

17

KANAMARU, NAOYOSHI, TAKAO NISHIZEKI, and TETSUO ASANO. "EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING." International Journal of Computational Geometry & Applications 04, no. 01 (March 1994): 69–85. http://dx.doi.org/10.1142/s0218195994000069.

Full text

Abstract:

This paper first presents an algorithm for enumerating all the integer-grid points in a given convex m-gon in O(K + m + log n) time where K is the number of such grid points and n is the dimension of the m-gon, i.e., the shorter length of the horizontal and vertical sides of an axis-parallel rectangle enclosing the m-gon. The paper next gives a simple algorithm which solves a two-variable integer programming problem with m constraints in O(m log m + log n) time where n is the dimension of a convex polygon corresponding to the feasible solution space. This improves the best known algorithm in complexity and simplicity. The paper finally presents algorithms for counting the number of grid points in a triangle or a simple polygon.

APA, Harvard, Vancouver, ISO, and other styles

18

Luo, Haoyang, Jun Luo, Ruimin Li, and Meiqi Yu. "Optimization Algorithm Design of Laser Marking Contour Extraction and Graphics Hatching Based on Image Processing Technology." Journal of Physics: Conference Series 2173, no. 1 (January 1, 2022): 012078. http://dx.doi.org/10.1088/1742-6596/2173/1/012078.

Full text

Abstract:

Abstract On the premise of solving the problem in a specific situation, this paper aims at the laser marking machine for the design and optimization of the outline extraction of the two-dimensional composite curve figure and the figure hatching scheme. The scanning line algorithm based on computer graphics and the polygon hatching are based on the algorithm theory. Based on the foundation, an improved polygon scan line algorithm model is established, and the contour extraction and graphic shadows of two-dimensional polygons are realized by MATLAB programming. The simulation results show that our algorithm model can meet our requirements well, and at the same time has a certain improvement effect. At the same time, compared with traditional two-dimensional polygon scanning and hatching algorithms, our algorithm model has strong analysis and processing capabilities and strong applicability. Compared with traditional two-dimensional polygon scanning and shading algorithms, model analysis can still run stably in a high refresh rate environment. We hope to further optimize the algorithm in the later stage, so that it can be better used in related engineering fields.

APA, Harvard, Vancouver, ISO, and other styles

19

Choi, J. G., S. W. Lee, and H. S. Kang. "Dynamic programming approach to optimal vertex selection for polygon-based shape approximation." IEE Proceedings - Vision, Image, and Signal Processing 150, no. 5 (2003): 287. http://dx.doi.org/10.1049/ip-vis:20030748.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Morey, Jim. "Programming in Polygon R&D: Explorations with a Spatial Language II." International Journal of Computers for Mathematical Learning 11, no. 2 (August 2, 2006): 147–75. http://dx.doi.org/10.1007/s10758-006-0004-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Fan, Junfu, Chenghu Zhou, Ting Ma, Min Ji, Yuke Zhou, and Tao Xu. "DWSI: an approach to solving the polygon intersection-spreading problem with a parallel union algorithm at the feature layer level." Boletim de Ciências Geodésicas 20, no. 1 (March 2014): 159–82. http://dx.doi.org/10.1590/s1982-21702014000100011.

Full text

Abstract:

A dual-way seeds indexing (DWSI) method based on R-tree and the Open Geospatial Consortium (OGC) simple feature model was proposed to solve the polygon intersection-spreading problem. The parallel polygon union algorithm based on the improved DWSI and the OpenMP parallel programming model was developed to validate the usability of the data partition method. The experimental results reveal that the improved DWSI method can implement a robust parallel task partition by overcoming the polygon intersection-spreading problem. The parallel union algorithm applied DWSI not only scaled up the data processing but also speeded up the computation compared with the serial proposal, and it showed a higher computational efficiency with higher speedup benchmarks in the treatment of larger-scale dataset. Therefore, the improved DWSI can be a potential approach to parallelizing the vector data overlay algorithms based on the OGC simple data model at the feature layer level.

APA, Harvard, Vancouver, ISO, and other styles

22

Wei, Liu, Hai Yan Chen, Li Li, Hai Ming Fu, and Li Wei. "Application of Thiessen Polygon Algorithm in Cellular Network Simulation System." Advanced Materials Research 532-533 (June 2012): 1851–56. http://dx.doi.org/10.4028/www.scientific.net/amr.532-533.1851.

Full text

Abstract:

Cellular mobile communication system divides the service area into several adjacent cells; each cell sets up a base station. In the traditional cellular representation, we always use regular hexagon to represent the cell. In the practical engineering applications and wireless network planning simulation systems, as the programming environment is complex and diverse, using the regular hexagon to represent the cellular network has limitation. This paper used Thiessen polygon and spatial analysis method to describe the cell service area with a polygon. This method intuitively displayed the relationship between the scope of service and its place with each other in space. For the Pre-construction and later optimization of wireless network planning it has a positive role.

APA, Harvard, Vancouver, ISO, and other styles

23

Guo, Q., B. Palanisamy, and H. A. Karimi. "A DISTRIBUTED POLYGON RETRIEVAL ALGORITHM USING MAPREDUCE." ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences II-4/W2 (July 10, 2015): 51–53. http://dx.doi.org/10.5194/isprsannals-ii-4-w2-51-2015.

Full text

Abstract:

The burst of large-scale spatial terrain data due to the proliferation of data acquisition devices like 3D laser scanners poses challenges to spatial data analysis and computation. Among many spatial analyses and computations, polygon retrieval is a fundamental operation which is often performed under real-time constraints. However, existing sequential algorithms fail to meet this demand for larger sizes of terrain data. Motivated by the MapReduce programming model, a well-adopted large-scale parallel data processing technique, we present a MapReduce-based polygon retrieval algorithm designed with the objective of reducing the IO and CPU loads of spatial data processing. By indexing the data based on a quad-tree approach, a significant amount of unneeded data is filtered in the filtering stage and it reduces the IO overhead. The indexed data also facilitates querying the relationship between the terrain data and query area in shorter time. The results of the experiments performed in our Hadoop cluster demonstrate that our algorithm performs significantly better than the existing distributed algorithms.

APA, Harvard, Vancouver, ISO, and other styles

24

Orlowski, M., and M. Pachter. "Linear programming in R3 and the skeleton and largest incircle of a convex polygon." Computers & Mathematics with Applications 13, no. 4 (1987): 401–5. http://dx.doi.org/10.1016/0898-1221(87)90008-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Yuhandri. "Perbandingan Metode Cropping pada Sebuah Citra untuk Pengambilan Motif Tertentu pada Kain Songket Sumatera Barat." Jurnal KomtekInfo 6, no. 1 (June 1, 2019): 97–107. http://dx.doi.org/10.35134/komtekinfo.v6i1.45.

Full text

Abstract:

At the time of image processing where we only need a certain part of an image according to the needs called the Region of Interest (ROI), in order to obtain that, the processing is carried out in a cropping process. Cropping is mostly done by researchers, especially those who research in the field of image processing in order to do data processing on an image, the results of cropping process on an image are usually done to make it easier for researchers to focus on something that is needed only. In this study is to compare existing cropping methods to get a motif found in an image of West Sumatra songket fabric. In this study using the method of cropping rectangle, square, circle, ellipse, polygon and tested using the Matlab programming language. The results of comparison of 5 cropping methods for taking certain motifs on the songket image with 5 different songket image samples, shows that the best results are obtained by using the polygon method. Polygon method can reach certain coordinate points in a songket image, so that the results of cropping are better and other motives that are carried along during the cropping process can be reduced.

APA, Harvard, Vancouver, ISO, and other styles

26

Lin, Huan, Dong Qiang Gao, and Jiang Miao Yi. "Surface Reconstruction and Nc Simulation of Auto Rearview Mirror Based on Geomagic Studio." Applied Mechanics and Materials 271-272 (December 2012): 515–18. http://dx.doi.org/10.4028/www.scientific.net/amm.271-272.515.

Full text

Abstract:

The key techniques of reverse engineering include data acquisition, data processing and model reconstruction.In this paper, with the automobile rearview mirror shell for example, scan the rearview mirror shell surface by laser scanner; then carries on the data processing to point cloud data(data processing include point cloud data registration, joining together and polygon stage processing). On the basis of data processing, fitting NURBS surface by Geomagic Studio software, thus completing surface reconstruction; Finally through the NC machining simulation, gets CNC programming, and to make the rearview mirror surface reconstruction and the numerical simulation.

APA, Harvard, Vancouver, ISO, and other styles

27

Nadyrshine, Neil, Lilia Nadyrshine, Rafik Khafizov, Nailia Ibragimova, and Karine Mkhitarian. "Parametric methods for constructing the Islamic ornament." E3S Web of Conferences 274 (2021): 09009. http://dx.doi.org/10.1051/e3sconf/202127409009.

Full text

Abstract:

The article discusses the method of algorithmic construction of Islamic ornaments, which can be used as a decorative element in architectural design. Two necessary stages are highlighted in the generation of an ornamental motif by means of algorithmic design – the first includes operations on a base mesh consisting of a combination of regular or semiregular cells, for example, drawing rays from the centers of the edges of the original lattice or rotating figures relative to its nodes; the second stage involves the creation of a basic pattern of the ornamental design that fits into a regular or semi-regular polygon, and the decorative motif in the figure is made up of a primitive that is symmetrically reflected relative to any lines, usually rays, emanating from opposite corners of the polygon. The paper analyses the traditional patterns of Islamic ornaments, on the basis of which new designs were built, using visual programming tools (Rhino and Grasshopper).

APA, Harvard, Vancouver, ISO, and other styles

28

Yamashita, Kohei, Yasuaki Ito, and Koji Nakano. "Bulk execution of the dynamic programming for the optimal polygon triangulation problem on the GPU." Concurrency and Computation: Practice and Experience 31, no. 19 (September 14, 2018): e4947. http://dx.doi.org/10.1002/cpe.4947.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Navarro-Mateu, Diego, and Ana Cocho-Bermejo. "Evo-Devo Strategies for Generative Architecture: Colour-Based Patterns in Polygon Meshes." Biomimetics 5, no. 2 (May 22, 2020): 23. http://dx.doi.org/10.3390/biomimetics5020023.

Full text

Abstract:

Parametric design in architecture is often pigeonholed by its own definition and computational complexity. This article explores the generative capacity to integrate patterns and flows analogous to evolutionary developmental biology (Evo-Devo) strategies to develop emergent proto-architecture. Through the use of coloured patterns (genotype) and the modification of polygonal meshes (phenotype), a methodological proposal is achieved that is flexible to changes and personalization, computationally efficient, and includes a wide range of typologies. Both the process and the result are oriented towards computational lightness for a future and better integration of the workflow in genetic algorithms. Flow-based programming is used to replicate genetic properties such as multifunctionality, repeatability and interchangeability. The results reinforce the biological strategies against other more computationally abstract ones and successfully execute the parallels of universal mechanisms in Evo-Devo that are present in life.

APA, Harvard, Vancouver, ISO, and other styles

30

Tlach, Vladimír, Zuzana Ságová, and Ivan Kuric. "Circular and quasi-circular paths for the industrial robots measuring with the Renishaw Ballbar QC20-W." MATEC Web of Conferences 254 (2019): 05007. http://dx.doi.org/10.1051/matecconf/201925405007.

Full text

Abstract:

Realized measuring with the Renishaw Ballbar QC20-W on industrial robots requires a special approach to measurement and creating of a circular path. In the article, two methods of the circular path creation are compared through experimental measurements. The first method is based on creating a circle using standard program commands in the FANUC programming environment. In the second method, the circular path is created as a polygon that represents the most accurate approximation of a circle required for a Ballbar measurement. The measurement methodology, the analysis of measurement data and results are presented in the article.

APA, Harvard, Vancouver, ISO, and other styles

31

Chen, Toly. "Applying a Fuzzy and Neural Approach for Forecasting the Foreign Exchange Rate." International Journal of Fuzzy System Applications 1, no. 1 (January 2011): 36–48. http://dx.doi.org/10.4018/ijfsa.2011010103.

Full text

Abstract:

Accurately forecasting the foreign exchange rate is important for export-oriented enterprises. For this purpose, a fuzzy and neural approach is applied in this study. In the fuzzy and neural approach, multiple experts construct fuzzy linear regression (FLR) equations from various viewpoints to forecast the foreign exchange rate. Each FLR equation can be converted into two equivalent nonlinear programming problems to be solved. To aggregate these fuzzy foreign exchange rate forecasts, a two-step aggregation mechanism is applied. At the first step, fuzzy intersection is applied to aggregate the fuzzy forecasts into a polygon-shaped fuzzy number to improve the precision. A back propagation network is then constructed to defuzzify the polygon-shaped fuzzy number and generate a representative/crisp value to enhance accuracy. To evaluate the effectiveness of the fuzzy and neural approach, a practical case of forecasting the foreign exchange rate in Taiwan is used. According to the experimental results, the fuzzy and neural approach improved both the precision and accuracy of the foreign exchange rate forecasting by 79% and 81%, respectively.

APA, Harvard, Vancouver, ISO, and other styles

32

Fekete, Sándor P., Andreas Haas, Phillip Keldenich, Michael Perk, and Arne Schmidt. "Computing Area-Optimal Simple Polygonizations." ACM Journal of Experimental Algorithmics 27 (December 31, 2022): 1–23. http://dx.doi.org/10.1145/3503607.

Full text

Abstract:

We consider methods for finding a simple polygon of minimum ( Min-Area ) or maximum ( Max-Area ) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical methods have received considerable attention. However, previous methods focused on heuristic methods, with no proof of optimality. We develop exact methods, based on a combination of geometry and integer programming. As a result, we are able to solve instances of up to \( n=25 \) points to provable optimality. While this extends the range of solvable instances by a considerable amount, it also illustrates the practical difficulty of both problem variants.

APA, Harvard, Vancouver, ISO, and other styles

33

Zhang, Jiansheng, Qiuyun Wang, Guiqian Xiao, and Jie Zhou. "Filling Path Planning and Polygon Operations for Wire Arc Additive Manufacturing Process." Mathematical Problems in Engineering 2021 (April 13, 2021): 1–12. http://dx.doi.org/10.1155/2021/6683319.

Full text

Abstract:

To improve the service life of hot forging die, the additive manufacturing algorithm and additive manufacturing device for die remanufacturing are developed. Firstly, a compound filling algorithm in which the inner zone is filled by linear scanning and the outer contour is filled by offsetting is developed in order to solve the problems encountered in filling path planning for wire arc additive manufacturing (WAAM) like staircase effect at marginal division, degenerated edge at outer contour, programming difficulty, and so forth. Meanwhile, the attitude control algorithm of welding gun is proposed to control the angle between welding gun and welding path so as to improve the welding forming quality. Secondly, the high-temperature and low-temperature wear resistances of Fe-based and Ni-based alloy are tested. The results show that Ni-based alloy has higher high-temperature wear resistance. Finally, a disabled crankshaft hot forging die is selected for application test and the results show that, using the techniques discussed in this paper, welding materials can be saved by more than 50% and machining cost can be saved by more than 60%. In addition, the surface of automatic-repaired die is smooth without oxidation, collapse, and other defects after forging 3000 times, which is much better than that of manual-repaired die.

APA, Harvard, Vancouver, ISO, and other styles

34

Wang, Zu Wei. "Design and Realization of Algorithm Visualization Teaching Presentation System on Computer Graphics." Applied Mechanics and Materials 687-691 (November 2014): 2768–71. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.2768.

Full text

Abstract:

Based on the study of abroad foundation on visual theory, we conduct depth discussion of the current introduction of visual teaching meaning. For the current computer graphics course content, we determine a visual teaching content and objectives, carry out the study and practice of computer graphics algorithm visualization teaching. This paper uses VB 6.0 visual programming tool to generate the basic primitives, polygon filling, cut a straight line segment, curve generation and visualization of fractal algorithm design and realization. Through analysis, this paper hold that use of visual teaching has a positive effect and influence for professors to change the way teachers help students understand computer graphics algorithm. In the process of teaching, students improve the understanding, exploration, discovery and creativity through observation, conjecture and verify.

APA, Harvard, Vancouver, ISO, and other styles

35

Khalili, Khalil, Seyed Yousef Ahmadi-Brooghani, and M. Rakhshkhorshid. "CAD Model Generation Using 3D Scanning." Advanced Materials Research 23 (October 2007): 169–72. http://dx.doi.org/10.4028/www.scientific.net/amr.23.169.

Full text

Abstract:

3D Scanners are used in industrial applications such as reverse engineering and inspection. Customization of existing CAD systems is one of rapid ways to supplying a 3D Scanning software. In this paper, using AutoLisp and Visual Basic programming languages, AutoCAD has been customized. Also facilities of automatic scanning of physical parts, in the domain of free form surfaces, have been provided. Furthermore, possibilities such as, control of scanner automotive system, representation of registered point clouds, generation of polygon and /or NURBS model from primary or modified point clouds, have been prepared. Triangulation and image processing techniques along with a new fuzzy logic algorithm have been used to extract the depth information more accurate. These, accompanying with AutoCAD capabilities have provided acceptable facilities for 3D scanning.

APA, Harvard, Vancouver, ISO, and other styles

36

Fang, Dandan, You Zheng, Botao Zhang, Xiangbo Li, Pengfei Ju, Hua Li, and Cunnian Zeng. "Automatic Robot Trajectory for Thermal-Sprayed Complex Surfaces." Advances in Materials Science and Engineering 2018 (July 8, 2018): 1–11. http://dx.doi.org/10.1155/2018/8697056.

Full text

Abstract:

Automatic trajectory generation for thermal spray application is highly desirable for today’s automotive manufacturing. Automatic robot trajectory for free-form surfaces to satisfy the coating uniform is still highly challenging due to the complex geometry of free-form surfaces. The purpose of this study is to present and implement a method for automatic generation of robot trajectory according to the given spray parameters on polygon profile and complex curved free-form surfaces, such as torch speed, spray distance, spray angle, and so on. This software development foundation is an Add-In programme of RobotStudio, which is off-line programming and simulation software of ABB Company. The experimental results show that the robot trajectory can be generated rapidly, accurately, and automatically on the complex geometries by this method.

APA, Harvard, Vancouver, ISO, and other styles

37

Mirzoev, Tigran, and Tzvetalin S. Vassilev. "Quadratic Time Computable Instances of MaxMin and MinMax Area Triangulations of Convex Polygons." Serdica Journal of Computing 4, no. 3 (October 21, 2010): 335–48. http://dx.doi.org/10.55630/sjc.2010.4.335-348.

Full text

Abstract:

We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programming in cubic time [2]. Later, Keil and Vassilev devised an algorithm that runs in O(n^2 log n) time [1]. In this paper we describe new geometric findings on the structure of MaxMin and MinMax Area triangulations of convex polygons in two dimensions and their algorithmic implications. We improve the algorithm’s running time to quadratic for large classes of convex polygons. We also present experimental results on MaxMin area triangulation.

APA, Harvard, Vancouver, ISO, and other styles

38

Sankar, V. A., and P. V. Y. Jayasree. "Design and Analysis of Novel Fractal Linear and Planar Array Antennas for Satellite Applications." Advanced Electromagnetics 5, no. 3 (December 1, 2016): 56. http://dx.doi.org/10.7716/aem.v5i3.400.

Full text

Abstract:

This article proposed a new geometric design methodology for the systematic expansion of fractal linear and planar array antennas. Using this proposed geometric design methodology any deterministic polygon shape can be constructed. In this article, two element fractal linear and triangular array antennas are examined using proposed methodology up to four iterations of two expansion factors. Due to the repetitive nature of the proposed geometric design methodology, both linear and planar fractal arrays shows multi-beam behavior with excellent array factor properties. The behavior of the proposed arrays shows better performance than linear and planar fractal array antennas generated by concentric circular ring sub array geometric generator. Triangular planar fractal array of expansion factor two at fourth iteration achieved a single valued beam width of 3.80 with -31.6 side lobe level. The suggested fractal arrays are analyzed and simulated by MATLAB-13 programming.

APA, Harvard, Vancouver, ISO, and other styles

39

Gavrilov, Taras. "Programming of the search algorithm for point belonging to the polygon and the mutual non-intersection of the figures." Technology audit and production reserves 3, no. 3(35) (May 30, 2017): 29–32. http://dx.doi.org/10.15587/2312-8372.2017.105505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Carlsson, John Gunnar, Benjamin Armbruster, Saladi Rahul, and Haritha Bellam. "A Bottleneck Matching Problem with Edge-Crossing Constraints." International Journal of Computational Geometry & Applications 25, no. 04 (December 2015): 245–61. http://dx.doi.org/10.1142/s0218195915500144.

Full text

Abstract:

Motivated by a crane assignment problem, we consider a Euclidean bipartite matching problem with edge-crossing constraints. Specifically, given [Formula: see text] red points and [Formula: see text] blue points in the plane, we want to construct a perfect matching between red and blue points that minimizes the length of the longest edge, while imposing a constraint that no two edges may cross each other. We show that the problem cannot be approximately solved within a factor less than 1:277 in polynomial time unless [Formula: see text]. We give simple dynamic programming algorithms that solve our problem in two special cases, namely (1) the case where the red and blue points form the vertices of a convex polygon and (2) the case where the red points are collinear and the blue points lie to one side of the line through the red points.

APA, Harvard, Vancouver, ISO, and other styles

41

Fauzi, Cholid, Syifaa Novianti, and Chandra Septyandi. "Combating Overtourism: The Use of Web-GIS in Visualizing Tourist Distribution and Travel Patterns." Journal of Tourism Sustainability 2, no. 2 (July 31, 2022): 79–87. http://dx.doi.org/10.35313/jtospolban.v2i2.44.

Full text

Abstract:

Web-GIS in the tourism sector can be done using website technology, namely by visualization based on tourism spatial attributes that display polygon-based patterns and points of tourist attraction locations to combat overtourism in tourist attractions. With the development of geospatial technology, tourists' distribution and travel patterns can be visualized by collecting data on tourist visits to tourist attractions and their routes. With the YWDM method, this web-gis was developed using the YWDM methodology with several phases according to the methods used. This application uses an open-source programming language, namely Javascript, and uses JSON as an upstream geodatabase. The results show that Web-GIS visualization of the distribution and travel patterns can make it easier to monitor the density of a tourist attraction. It is well developed in providing more accurate information on the distribution and density of tourist attractions. With the YWDM methodology, visualization can be done like the software development stage and equipped with steps in need for spatial data management.

APA, Harvard, Vancouver, ISO, and other styles

42

Qiu, Changwu, Qixin Cao, Leibin Yu, and Shouhong Miao. "Improving the stability level for on-line planning of mobile manipulators." Robotica 27, no. 3 (May 2009): 389–402. http://dx.doi.org/10.1017/s0263574708004803.

Full text

Abstract:

SUMMARYThis paper presents a quadratic programming (QP) form algorithm to realize on-line planning of mobile manipulators with consideration for improving the stability level. With Lie group and screw tools, the general tree topology structure mobile robot dynamics and dynamic stability attributes were analysed. The stable support condition for a mobile robot is constructed not only in a polygonal support region, but also in a polyhedral support region. For a planar supporting region, the tip-over avoiding requirement is formulated as the tip-over prevent constraints with the reciprocal products of the resultant support wrench and the imaginary tip-over twists, which are constructed with the boundaries of the convex support polygon. At velocity level, the optimized resolution algorithm with standard QP form is designed to resolve the inverse redundant kinematics of the Omni-directional Mobile ManipulatorS (OMMS) with stability considerations. Numerical simulation results show that the presented methods successfully improve the stability level of the robot within an on-line planning process.

APA, Harvard, Vancouver, ISO, and other styles

43

ZIPPEL, RICHARD. "THE DATA STRUCTURE ACCELERATOR ARCHITECTURE." International Journal of High Speed Electronics and Systems 07, no. 04 (December 1996): 533–71. http://dx.doi.org/10.1142/s012915649600030x.

Full text

Abstract:

We present a heterogeneous architecture that contains a fine grained, massively parallel SIMD component called the data structure accelerator and demonstrate its use in a number of problems in computational geometry including polygon filling and convex hull. The data structure accelerator is extremely dense and highly scalable. Systems of 106 processing elements can be embedded in workstations and personal computers, without dramatically changing their cost. These components are intended for use in tandem with conventional single sequence machines and with small scale, shared memory multiprocessors. A language for programming these heterogeneous systems is presented that smoothly incorporates the SIMD instructions of the data structure accelerator with conventional single sequence code. We then demonstrate how to construct a number of higher level primitives such as maximum and minimum, and apply these tools to problems in logic and computational geometry. For computational geometry problems, we demonstrate that simple algorithms that take advantage of the parallelism available on a data structure accelerator perform as well or better than the far more complex algorithms which are needed for comparable efficiency on single sequence computers.

APA, Harvard, Vancouver, ISO, and other styles

44

Ou, Linlin, Yuan Su, and Xuanguang Chen. "Characterization of the Stabilizing PID Controller Region for the Model-Free Time-Delay System." Journal of Applied Mathematics 2013 (2013): 1–9. http://dx.doi.org/10.1155/2013/926430.

Full text

Abstract:

For model-free time-delay systems, an analytical method is proposed to characterize the stabilizing PID region based on the frequency response data. Such characterization uses linear programming which is computationally efficient. The characteristic parameters of the controller are first extracted from the frequency response data. Subsequently, by employing an extended Hermite-Biehler theorem on quasipolynomials, the stabilizing polygon region with respect to the integral and derivative gains(kiandkd)is described for a given proportional gain(kp)in term of the frequency response data. Simultaneously, the allowable stabilizing range ofkpis derived such that the complete stabilizing set of the PID controller can be obtained easily. The proposed method avoids the complexity and inaccuracy of the model identification and thus provides a convenient approach for the design and tuning of the PID controller in practice. The advantage of the proposed algorithm lies in that the boundaries of the stabilizing region consist of several simple straight lines, the complete stabilizing set can be obtained efficiently, and it can be implemented automatically in computers.

APA, Harvard, Vancouver, ISO, and other styles

45

BORGELT, MAGDALENE GRANTSON, CHRISTIAN BORGELT, and CHRISTOS LEVCOPOULOS. "FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM." International Journal of Computational Geometry & Applications 18, no. 03 (June 2008): 185–220. http://dx.doi.org/10.1142/s0218195908002581.

Full text

Abstract:

We discuss and compare four fixed parameter algorithms for finding the minimum weight triangulation of a simple polygon with (n – k) vertices on the perimeter and k vertices in the interior (hole vertices), that is, for a total of n vertices. All four algorithms rely on the same abstract divide-and-conquer scheme, which is made efficient by a variant of dynamic programming. They are essentially based on two simple observations about triangulations, which give rise to triangle splits and paths splits. While each of the first two algorithms uses only one of these split types, the last two algorithms combine them in order to achieve certain improvements and thus to reduce the time complexity. By discussing this sequence of four algorithms we try to bring out the core ideas as clearly as possible and thus strive to achieve a deeper understanding as well as a simpler specification of these approaches. In addition, we implemented all four algorithms in Java and report results of experiments we carried out with this implementation.

APA, Harvard, Vancouver, ISO, and other styles

46

Yu, M. T., T. Y. Lin, and C. Hung. "Active-set sequential quadratic programming method with compact neighbourhood algorithm for the multi-polygon mass production cutting-stock problem with rotatable polygons." International Journal of Production Economics 121, no. 1 (September 2009): 148–61. http://dx.doi.org/10.1016/j.ijpe.2009.01.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Novović, Olivera, Sanja Brdar, Minučer Mesaroš, Vladimir Crnojević, and Apostolos N. Papadopoulos. "Uncovering the Relationship between Human Connectivity Dynamics and Land Use." ISPRS International Journal of Geo-Information 9, no. 3 (February 26, 2020): 140. http://dx.doi.org/10.3390/ijgi9030140.

Full text

Abstract:

CDR (Call Detail Record) data are one type of mobile phone data collected by operators each time a user initiates/receives a phone call or sends/receives an sms. CDR data are a rich geo-referenced source of user behaviour information. In this work, we perform an analysis of CDR data for the city of Milan that originate from Telecom Italia Big Data Challenge. A set of graphs is generated from aggregated CDR data, where each node represents a centroid of an RBS (Radio Base Station) polygon, and each edge represents aggregated telecom traffic between two RBSs. To explore the community structure, we apply a modularity-based algorithm. Community structure between days is highly dynamic, with variations in number, size and spatial distribution. One general rule observed is that communities formed over the urban core of the city are small in size and prone to dynamic change in spatial distribution, while communities formed in the suburban areas are larger in size and more consistent with respect to their spatial distribution. To evaluate the dynamics of change in community structure between days, we introduced different graph based and spatial community properties which contain latent footprint of human dynamics. We created land use profiles for each RBS polygon based on the Copernicus Land Monitoring Service Urban Atlas data set to quantify the correlation and predictivennes of human dynamics properties based on land use. The results reveal a strong correlation between some properties and land use which motivated us to further explore this topic. The proposed methodology has been implemented in the programming language Scala inside the Apache Spark engine to support the most computationally intensive tasks and in Python using the rich portfolio of data analytics and machine learning libraries for the less demanding tasks.

APA, Harvard, Vancouver, ISO, and other styles

48

Chernikov, Oleksandr. "Increasing Computer Modeling Capabilities by using API (at the example of Autodesk Inventor package)." Bulletin of Kharkov National Automobile and Highway University, no. 99 (December 29, 2022): 111. http://dx.doi.org/10.30977/bul.2219-5548.2022.99.0.111.

Full text

Abstract:

Problem. The work builds on and extends the previous studies on broadening the possibilities of computer modeling and adapting relevant software packages to develop design documentation in accordance with standards. The purpose of this paper is to create and distribute modules aimed at simplifying users´ experience when working with 3D modeling packages. This simplification is achieved by using the application programming interface (API) as a special protocol to facilitate the interaction of computer programs, in particular, in the environment of the Autodesk Inventor package. Goal. The main task is to explore API programs and develop/improve algorithms and methods for creating digital models of objects. That includes the use of programming languages and capabilities that appeared in the latest versions of Autodesk Inventor, Fusion programs 360, AutoCAD, Revit, etc.). Methodology. To address the aims of this paper, the problem of constructing a regular conical chamfer for prismatic bodies with a regular polygon base was posed and solved using the API program. The problem of constructing a conical chamfer for holes facing cylindrical surfaces is also solved. A number of further tasks has been set to accelerate the 3D modeling process. Results. In order to solve the above questions, the attention should be focused on a deeper mastery of the API management capabilities of objects, methods and properties of their elements belonging to the relevant environment. Basically, all operations performed in dialog mode can be programmed using appropriate macros. Originality. The tools for part's elements creation has been developed with considering of manufacturing technology based on API. The proposed approach expands the possibilities of modeling. Practical value. The proposed algorithms and tools application will significantly speed up the design process for special elements of various parts.

APA, Harvard, Vancouver, ISO, and other styles

49

Myoupo, Jean Frédéric, and Vianney Kengne Tchendji. "An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem." International Journal of Grid and High Performance Computing 6, no. 2 (April 2014): 74–100. http://dx.doi.org/10.4018/ijghpc.2014040105.

Full text

Abstract:

This study focuses on the parallel resolution of the matrix chain ordering problem and the optimal convex polygon triangulation problem on the Coarse grain multicomputer model (CGM for short). There has been intensive work on the parallelization of these dynamic programming problems in PRAM, including the use of systolic arrays, but a BSP/CGM solution is necessary for ease of implementation and portability. Our CGM algorithm is based on Yao's sequential solution running in O(n2) time and O(n2) space. This CGM algorithm uses p processors, each with O(n/p) local memory. It requires at most O(S/p×n2) running time with S communication rounds and with S/p<1. Our algorithm performs better than the algorithm proposed in 2012 by Dilson and Marco when S is less than n/p. We offer several ways of partitioning the problem to solve and study the impact of each partitioning algorithm performance. A CGM solution exists based on Yao's algorithm, but the subdivision of tasks is defined according to the BSP cost model. In this paper, we propose a solution based only on the CGM model specifications. Note that S is the number of super-steps of the CGM algorithm.

APA, Harvard, Vancouver, ISO, and other styles

50

Shi, Zhuo, and Fang Li. "Active Subdivision Snake Scheme." Applied Mechanics and Materials 44-47 (December 2010): 3917–21. http://dx.doi.org/10.4028/www.scientific.net/amm.44-47.3917.

Full text

Abstract:

Active contours or Snakes are extensively used in computer vision and image processing applications, to locate the object boundaries. Low convergence speed and high complexity in computing have significantly limited their utilities. By taking these problems into consideration, the present research focuses on a novel way in rapid image segmentation methodology. This method utilizes subdivision curves in combination with the Gradient Vector Flow (GVF) snakes to overcome these problems. GVF snakes use region energy minimization which is superior to the mass-spring model of the Tamed snake in whole contour. Furthermore, subdivision curves provide a hierarchical and smooth representation of a shape which is significantly in fine scales. After every step of subdivision, reversely compute the region energy of the subdivision polygon and the local adaptive compensation is carried out. A discrete curvature estimator is used to avoid additional computing in the flat regions of a curve. Therefore, only the segments with high curvature or with fine details require more reverse subdivision computing. Reverse subdivision scheme gives the required flexibility while dealing with a local adaptive compensation. The above-mentioned scheme is similar to dynamic programming. This leads the convergence computing to the appropriate subdivision direction. Rapid reverse computing and absolute reversible and lossless are significant advantages of this scheme. It determines the speed and briefness of the Subdivision Snakes Model. Active Subdivision Snake Model (ASSM) will be very efficient in to detect objects when they are at motion and image registration.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Polyglot programming'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles