Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Intersection of a polyhedron with a line"'
Publikováno v:
Journal of Computational Physics. 338:1-17
The Multi-Material Arbitrary Lagrangian Eulerian (MMALE) method is an effective way to simulate the multi-material flow with severe surface deformation. Comparing with the traditional Arbitrary Lagrangian Eulerian (ALE) method, the MMALE method allow
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8fccbbd1107bec1aef94a5d9caa00ea
https://doi.org/10.1016/j.jcp.2017.02.029
https://doi.org/10.1016/j.jcp.2017.02.029
Autor:
Vaclav Skala
A new O(lg N) line clipping algorithm in E2 against a convex window is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of the proposed algorithm with others sh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3fd64f502a99b8a3a54581dc74a0f994
http://arxiv.org/abs/1801.00442
http://arxiv.org/abs/1801.00442
Autor:
Sushil Chandra Dimri
Publikováno v:
International Journal of Computer Applications. 127:31-34
most popular lines clipping algorithms are Cohen- Sutherland and Liang-Barsky line clipping algorithm. These algorithms are complex and the steps of calculation are very high. This paper proposes a simple new line clipping algorithm for 2D space whic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f6613187a4dfb537168524347ba2227
https://doi.org/10.5120/ijca2015906352
https://doi.org/10.5120/ijca2015906352
Autor:
Valery Zorkaltsev
Publikováno v:
2017 Constructive Nonsmooth Analysis and Related Topics (dedicated to the memory of V.F. Demyanov) (CNSA).
The problem of search of closest point of polyhedron to origin is considered under different definitions of concept “closeness”. Polyhedron is defined as set of solutions of system of linear inequalities. Properties and relations of Euclidean, Ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87afa3c5d70bc7f94708719cdb3c9adf
https://doi.org/10.1109/cnsa.2017.7974039
https://doi.org/10.1109/cnsa.2017.7974039
Autor:
Rui-Juan Jing, Marc Moreno Maza
Publikováno v:
Computer Algebra in Scientific Computing ISBN: 9783319663197
CASC
CASC
Let K be a polyhedron in \({\mathbb R}^d\), given by a system of m linear inequalities, with rational number coefficients bounded over in absolute value by L. In this series of two papers, we propose an algorithm for computing an irredundant represen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91ecdb1694b896f42174b4702a6fb329
https://doi.org/10.1007/978-3-319-66320-3_17
https://doi.org/10.1007/978-3-319-66320-3_17
Autor:
Rui-Juan Jing, Marc Moreno Maza
Publikováno v:
Computer Algebra in Scientific Computing ISBN: 9783319663197
CASC
CASC
Let K be a polyhedron in \({{{\mathbb R}}}^d\), given by a system of m linear inequalities, with rational number coefficients bounded over in absolute value by L. In this series of two papers, we propose an algorithm for computing an irredundant repr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0389764bb975d017d97d37ead628f8b
https://doi.org/10.1007/978-3-319-66320-3_18
https://doi.org/10.1007/978-3-319-66320-3_18
Autor:
Michael Hunter, Wonho Suh
Publikováno v:
KSCE Journal of Civil Engineering. 18:1140-1149
Unconventional intersection designs have been receiving increased consideration at intersections that serve high traffic demands. Although operational performance of unconventional intersections has been evaluated in a number of studies, little resea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d804f3cf8b402095fd18deb960b9a75
https://doi.org/10.1007/s12205-014-0225-8
https://doi.org/10.1007/s12205-014-0225-8
Publikováno v:
Advanced Materials Research. 709:499-502
In this paper, a class of non-manifold polyhedron is introduced and researched from a decomposition and mapping model (D-M for short). Design computing from function-to-form mapping and shape decomposition etc is reported. Modelling of non-manifold p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e452c9c7f1b20ea965a602887097269b
https://doi.org/10.4028/www.scientific.net/amr.709.499
https://doi.org/10.4028/www.scientific.net/amr.709.499
Publikováno v:
Applied Mechanics and Materials. :1313-1317
Through the arduous study of the famous Cohen-Sutherland algorithm, this paper proposes a novel improved algorithm by analyzing its main flaw in efficiency. The line segment without the clipping window will be rejected in our algorithm. By means of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d50b300f680aa1ca2ae06e045e7aabf
https://doi.org/10.4028/www.scientific.net/amm.239-240.1313
https://doi.org/10.4028/www.scientific.net/amm.239-240.1313
Publikováno v:
2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference.
Graphic clipping algorithm is a hotspot all the time in computer graphics. Based upon non-intersect polygon boundary, a clipping algorithm on vector graphics is proposed in this paper. The proposed algorithm can be divided into three steps. First, el
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cb55f2cc329c39cb45d32d856132cd8
https://doi.org/10.1109/itnec.2016.7560482
https://doi.org/10.1109/itnec.2016.7560482