• Title/Summary/Keyword: 정점선택

Search Result 78, Processing Time 0.025 seconds

3D Magic Wand: Interface for Mesh Segmentation Using Harmonic Field (3D Magic Wand: 하모닉 필드를 이용한 메쉬 분할 기법)

  • Moon, Ji-Hye;Park, Sanghun;Yoon, Seung-Hyun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.28 no.1
    • /
    • pp.11-19
    • /
    • 2022
  • In this paper we present a new method for interactive segmentation of a triangle mesh by using the concavity-sensitive harmonic field and anisotropic geodesic. The proposed method only requires a single vertex in a desired feature region, while most of existing methods need explicit information on segmentation boundary. From the user-clicked vertex, a candidate region which contains the desired feature region is defined and concavity-senstive harmonic field is constructed on the region by using appropriate boundary constraints. An initial isoline is chosen from the uniformly sampled isolines on the harmonic field and optimal points on the initial isoline are determined as interpolation points. Final segmentation boundary is then constructed by computing anisotropic geodesics passing through the interpolation points. In experimental results, we demonstrate the effectiveness of the proposed method by selecting several features in various 3D models.

Procedural Modeling Algorithm for Traditional Stone Fence Creator (전통 돌담 생성을 위한 절차적 모델링 알고리즘)

  • Park, Kyeongsu
    • Journal of Digital Convergence
    • /
    • v.11 no.8
    • /
    • pp.205-212
    • /
    • 2013
  • In this paper, we present a procedural modeling algorithms to create Korean traditional stone fence using the fractal subdivision. The main process of the algorithm is to get the next step mesh by subdividing each triangle in the previous step triangular mesh. This process is repeated recursively. Dividing each triangle into four sub-triangles after choosing a random point on each side of the triangle and moving each vertices in the normal direction with random perturbations make the bumpy appearance of stone fences. In each step we remove flat vertices which does not influence the shape of the stone. The discrete curvature determines the flatness of a vertex. New triangles whose vertices are the vertices around the removed vertex are added to make a triangular mesh.

Generalized Borůvka's Minimum Spanning Tree Algorithm (일반화된 Borůvka 최소신장트리 알고리즘)

  • Choi, Myeong-Bok;Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.165-173
    • /
    • 2012
  • Given a connected, weighted, and undirected graph, the Minimum Spanning Tree (MST) should have minimum sum of weights, connected all vertices, and without any cycle taking place. Borůvka Algorithm is firstly suggested as an algorithm to evaluate the MST, but it is not widely used rather than Prim and Kruskal algorithms. Borůvka algorithm selects the Minimum Weight Edge (MWE) from each vertex with distinct weights in $1^{st}$ stage, and selects the MWE from each MSF (Minimum Spanning Forest) in $2^{nd}$ stage. But the cycle check and the number of MSF in $1^{st}$ stage and $2^{nd}$ stage are difficult to implication by computer program even if it is easy to verify visually. This paper suggests the generalized Borůvka Algorithm, This algorithm selects all of the same MWEs for each vertex, then checks the cycle and constructs MSF for ascending sorted MWEs. Kruskal method bring into this process. if the number of MSF greats then 1, this algorithm selects MWE from ascending sorted inter-MSF edges. The generalized Borůvka algorithm is verified its application by being applied to the 7 graphs with the many minimum weights or distinct weight edges for any vertex. As a result, the generalized Borůvka algorithm is less required for cycle verification then the Kruskal algorithm. Therefore, the generalized Borůvka algorithm is more fast to obtain MST then Kruskal algorithm.

유류오염 토양에서 유류성분의 생분해와 무기오염 물질 함량의 관계성에 대한 예비 연구

  • 강진규;송윤구;문지원;이민희;이규호
    • Proceedings of the KSEEG Conference
    • /
    • 2003.04a
    • /
    • pp.241-244
    • /
    • 2003
  • 유류오염 토양내 유류의 분해와 무기오염물질의 함량과의 관계성을 알아보기위해 부산 문헌지구의 유류 오염 토양 profile중 유류가 비교적 많은 두 층과 유기물이 다량 함유된 제주도 토양을 경유로 오염시킨 토양을 선택하여 유류가 분해 정도와 Pb, Zn, Cd, Ni의 함량을 측정 비교하였다. 토양 채취후 즉시 유류를 추출한 것, 15일간 별도의 미생물 영양원을 가하지 않고 습도와 통풍만을 행하여 토양내 존재하는 미생물들에 의하여만 유류가 분해되도록 한 것, $105^{\circ}C$에서 24시간 열처리를 행하여 미생물에 의한 분해보다는 물리적인 방법으로 비교적 강하게 처리한 것 세가지 경우에서 토양에서 추출한 유류를 분석한 결과 normal alkane이 서서히 상당량 분해되는 양상을 보여주었다. 토양내 Pb, Zn, Cd, Ni를 분석한 결과 부산 시료의 경우 두 층(B2, B3)모두 Cd은 검출한계 이하로, Ni의 경우 극소량의 함량을 보여주었다. Zn의 경우 B2는 28~29ug/g, B3는 12~14ug/g으로 세가지 경우 별 차이 없는 양상을 보여 주었다. 하지만, Pb의 경우 B2에서는 그 함량이 유류의 normal alkane의 분해와 함께 서서히 증가하는 경향을 확연히 보여주었으며, B3의 경우도 B2와 유사한 변화 양상을 보여주었다. 제주도 토양의 경우 Pb는 검출되지 않았고, Zn은 소량 검출되었다. Ba, Ni 함량은 normal alkane 분해에 따라 다소 증가하였다. 따라서, 본 예비실험을 통하여 유류오염 토양에서 유류의 분해와 일부 무기이온사이에는 관련성을 갖고 있으며, 이는 유류 분해정도를 파악하는 지시자로써 특정 무기 오염물질을 이용할 수 있을 가능성이 있으므로 좀더 이들 관계성에 대한 연구가 진행될 필요성이 있다고 판단된다.고 과학적으로 분석할 수 있는 방법이 될 수 있을 것으로 기대된다. 의미를 되새기는 것으로 짧은 연구를 시작하겠다. 등은 활성 값이 70% 이상으로 퇴적물 독성이 상대적으로 낮았다. 이중나선 DNA 함량은 28.4 % - 49%로 대조군에 비해서 감소가 크다. 대부분의 정점이 대조군의 30% 내외로 정점 간의 차이는 크지는 않다. 그러나 다른 측정자료와 같이 정점 22에서 18%로 최소치를 나타내고, 정점 2, 12에서 20% 내외의 값을 보인다. 종합적으로 볼 때 오염물질의 유입이 크고, 광양제철 인근 정점 들이 모두 다른 정점에 비해서 낮아서, 퇴적물 독성이 높은 정점으로 조사되었다.hiwo의 광합성 능력은 낮은 농도들에서는 대조구와 유사하였으나, 5 $\mu\textrm{g}$/l의 높은 농도에서는 초기에 매우 낮은 광합성 능력을 보이다가 시간이 경과하면서 대조군보다 더 높은 경향을 나타냈다. 이러한 결과는 식물플랑크톤이 benso[a]pyrene의 낮은 농도에서 노출될 때는 이 물질을 탄소원으로 사용할 가능성이 있음을 시사한다. 본 연구의 결과들은 연안해역에 benso[a]pyrene과 같은 지속성 유기오염물질이 유입되었을 때 내정여부에 따라 식물플랑크톤 군집내 종 천이와 일차생산력에 크게 영향을 미칠 수 있음을 시사한다.TEX>5.2개)였으며, 등급별 회수율은 각각 GI(8.5%), GII(13.4%), GIII(43.9%), GIV(34.2%)로 나타났다.ments of that period left both in Japan and Korea. "Hyojedo" in Korea is supposed to have been influenced by the letter design. Asite- is also considered to have been "Japan

  • PDF

Proposal of Minimum Spanning Tree Algorithm using 2-Edges Connected Grap (2-간선 연결 그래프를 사용한 최소신장트리 알고리즘 제안)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.233-241
    • /
    • 2014
  • This paper suggests a fast minimum spanning tree algorithm which simplify the original graph to 2-edge connected graph, and using the cycling property. Borůvka algorithm firstly gets the partial spanning tree using cycle property for one-edge connected graph that selects the only one minimum weighted edge (e) per vertex (v). Additionally, that selects minimum weighted edge between partial spanning trees using cut property. Kruskal algorithm uses cut property for ascending ordered of all edges. Reverse-delete algorithm uses cycle property for descending ordered of all edges. Borůvka and Kruskal algorithms always perform |e| times for all edges. The proposed algorithm obtains 2-edge connected graph that selects 2 minimum weighted edges for each vertex firstly. Secondly, we use cycle property for 2-edges connected graph, and stop the algorithm until |e|=|v|-1 For actual 10 benchmark data, The proposed algorithm can be get the minimum spanning trees. Also, this algorithm reduces 60% of the trial number than Borůvka, Kruskal and Reverse-delete algorithms.

Processing Sliding Window Multi-Joins using a Graph-Based Method over Data Streams (데이터 스트림에서 그래프 기반 기법을 이용한 슬라이딩 윈도우 다중 조인 처리)

  • Zhang, Liang;Ge, Jun-Wei;Kim, Gyoung-Bae;Lee, Soon-Jo;Bae, Hae-Young;You, Byeong-Seob
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.2
    • /
    • pp.25-34
    • /
    • 2007
  • Existing approaches that select an order for the join of three or more data streams have always used the simple heuristics. For their disadvantage - only one factor is considered and that is join selectivity or arrival rate, these methods lead to poor performance and inefficiency In some applications. The graph-based sliding window multi -join algorithm with optimal join sequence is proposed in this paper. In this method, sliding window join graph is set up primarily, in which a vertex represents a join operator and an edge indicates the join relationship among sliding windows, also the vertex weight and the edge weight represent the cost of join and the reciprocity of join operators respectively. Then the optimal join order can be found in the graph by using improved MVP algorithm. The final result can be produced by executing the join plan with the nested loop join procedure, The advantages of our algorithm are proved by the performance comparison with existing join algorithms.

  • PDF

On the Trophic Correlation between Tintinnids and Dinoflagellates in Masan Bay, Korea (마산만의 유종섬모충류와 와편모류간의 포식-피포식 상관관계에 대하여)

  • YOO Kwang-Il;LEE Joon-Baek
    • Korean Journal of Fisheries and Aquatic Sciences
    • /
    • v.20 no.3
    • /
    • pp.230-236
    • /
    • 1987
  • The correlation between tintinnid and dinoflagellate by means of seasonal variation of standing crops was investigated at two selected stations in Masan Bay, well-known as a red tide zone in southern coastal waters of Korea, during the period from January 1981 to December 1982. The most dominant dinoflagellates mainly belonged to $20-60\;{\mu}m$ of size class, and Gymnodinium and Prorocentrum were predominant from spring to summer season. Of tintinnid, Favella spp. were most dominant and associated with dinoflagellate blooms at the same season. Especially, Favella spp. were most positively correlated with $40-60\;{\mu}m$ size class of dinoflagellate, and also represented higher multiple corrleation with outer station (St.2), comprising relatively large species of Gymonodinium and Protogonyaulax, than with inner station (St. 1), dominated by Prorocentrum blooms. Thus, the interspecific food selection by size and morphology between tintinnid including Favella and dinoflagellate is recognized and it is considered to be an important factor influenecing on the prey-predator relationship in lower trophic level in the surveyed area.

  • PDF

Simultaneous Simplification of Multiple Triangle Meshes for Blend Shape (블렌드쉐입을 위한 다수 삼각 메쉬의 동시 단순화 기법)

  • Park, Jung-Ho;Kim, Jongyong;Song, Jonghun;Park, Sanghun;Yoon, Seung-Hyun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.25 no.3
    • /
    • pp.75-83
    • /
    • 2019
  • In this paper we present a new technique for simultaneously simplifying N triangule meshes with the same number of vertices and the same connectivities. Applying the existing simplification technique to each of the N triangule mesh creates a simplified mesh with the same number of vertices but different connectivities. These limits make it difficult to construct a simplified blend-shape model in a high-resolution blend-shape model. The technique presented in this paper takes into account the N meshes simultaneously and performs simplification by selecting an edge with minimal removal cost. Thus, the N simplified meshes generated as a result of the simplification retain the same number of vertices and the same connectivities. The efficiency and effectiveness of the proposed technique is demonstrated by applying simultaneous simplification technique to multiple triangle meshes.

Sea-level Change and Coastal Erosion (해수면 변화와 해안 침식)

  • Jeon, Dong-Chull
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.7 no.4
    • /
    • pp.289-304
    • /
    • 1995
  • Time series of the relative sea levels at the selected tide-gauge stations in the North Pacific and historical aerial photographs in the Hawaiian Islands are analyzed. Long-term rising trend of sea level ranges from +1 to +5 mm/yr at most of the stations, which is primarily due to global warming and tectonic motion of the plates. The annual and interannual fluctuations of sea level result from the thermal expansion/contraction of sea-surface layer due to the annual change of the solar radiation and possibly from a coupled ocean-atmosphere phenomenon associated with an ENSO event, respectively. Sea-level changes in three different time-scales (linear trend. annual oscillation, and interannual fluctuation) and their quantitative contribution to the shoreline changes as a result of long-term cross-shore sediment transport arc hypothesized.

  • PDF

The Lateral Earth Pressure on Rigid Retaining Wall Due to the Various Modes of Wall Movement (벽체변위에 따른 기류벽에 작용하는 토압)

  • Chae, Yeong-Su;Im, Byeong-Ju;Baek, Yeong-Sik
    • Geotechnical Engineering
    • /
    • v.1 no.1
    • /
    • pp.21-30
    • /
    • 1985
  • The reasonable static and dynamic earth pressure equations were developed by applying the Dubrova's theory and Chang's method to the following cases of wall movements; (1) Active case rotating about the top (2) Active case rotating about the bottom (3) Passive case rotating about the top (4) Passive case rotating about the bottom The equations are presented in accordance with particular wall displacements for the sand and cohesive back-fill, respectively. The results computed by the proposed equations are compared with the conventional theoretical values.

  • PDF