• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.382-386
• /
• 2004

This paper presents an algorithm for the triangular mesh intersection problem. The key aspect of the proposed algorithm is to reduce the number of triangle pairs to be checked for intersection. To this end, it employs two different approaches, the Y-group approach and the space partitioning approach. Even though both approaches have the same objective of reducing the number of triangular-triangular intersection (TTI) pairs, their inherent characteristics are quite different. While the V-group approach works by topology (reduces TTI pairs by guaranteeing no intersection among adjacent triangles), the space partitioning approach works by geometry (reduces TTI pairs by guaranteeing no intersection among distant triangles). The complementary nature of the two approaches brings substantial improvement in reducing the number TTI pairs.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.606-608
• /
• 2003

This paper investigates the accuracy of three-dimensional positioning for EROS A stereo pairs when different numbers of ground control points are employed. The major works of the proposed schemes include: (1) initialization of orientation parameters (2) preliminary orbit fitting, (3) orbit refinement using the least squares filtering technique, and (4) space intersection. The experiment includes validation of positioning accuracy for an EROS A in-track stereo pair when different number of check points are employed.

• Spatial Information Research
• /
• v.15 no.2
• /
• pp.169-180
• /
• 2007

Applicability of Land-based MMS(Mobile Mapping System) having been increased gradually as digitalization of administrative operation and construction of integrated systems of the government and provincial government are growing up. As these requirements, the case can be occurred that the facilities should be surveyed rapidly in the specific area. At this case, the real time field processing method is more necessary than the post processing method and data processing speed should be an essential element as important as accuracy. In this study, the two space intersection methods used in photogrammetry were programmed and compared with each other to select more proper method for the three dimensional positioning in the field processing. Especially, at the analytic space intersection, the traditional close range terrestrial photogrammetry was modified and applied to that to adapt to MMS's characteristics that camera position and attitude are changed according to the vehicle movement. As a result, the difference of the accuracy between two methods is not significant but at the calculation time, the analytic space intersection is faster three times than the space intersection using collinearity condition.

• East Asian mathematical journal
• /
• v.16 no.1
• /
• pp.61-69
• /
• 2000

We show that the intersection of two standard torus knots of type (${\lambda}_1$, ${\lambda}_2$) and (${\beta}_1$, ${\beta}_2$) induces an automorphism of the cyclic group ${\mathbb{Z}}_d$, where d is the intersection number of the two torus knots and give an elementary proof of the fact that all non-trivial torus knots are strongly invertiable knots. We also show that the intersection of two standard knots on the 3-torus $S^1{\times}S^1{\times}S^1$ induces an isomorphism of cyclic groups.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1073-1076
• /
• 1987

In this paper, a new ray tracing algorithm which uses space subdivision method is introduced. In order to reduce huge number of ray-surface intersection calculation, the space is subdivided as lattice that contains minimum number of objects. With lattice structure, the process that calculates unnecessary ray-surface intersection is eliminated.

• The Pure and Applied Mathematics
• /
• v.3 no.2
• /
• pp.163-171
• /
• 1996

Observing that a locally weakly Lindel$\"{o}$f space is a quasi-F space if and only if it has an F-base, we show that every dense weakly Lindel$\"{o}$f subspace of an almost-p-space is C-embedded, every locally weakly Lindel$\"{o}$f space with a cocompact F-base is a locally compact and quasi-F space and that if Y is a dense weakly Lindel$\"{o}$f subspace of X which has a cocompact F-base, then $\beta$Y and X are homeomorphic. We also show that for any a separating nest generated intersection ring F on a space X, there is a separating nest generated intersection ring g on $\phi_{Y}^{-1}$(X) such that QF(w(X, F)) and ($\phi_{Y}^{-1}$(X),g) are homeomorphic and $\phi_{Y}_{x}$(g$^#$)=F$^#$.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.2
• /
• pp.485-494
• /
• 2023

Let Y be the quintic del Pezzo 4-fold defined by the linear section of Gr(2, 5) by ℙ⁷. In this paper, we describe the locus of double lines in the Hilbert scheme of coincs in Y. As a corollary, we obtain the desigularized model of the moduli space of stable maps of degree 2 in Y. We also compute the intersection Poincaré polynomial of the stable map space.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.10a
• /
• pp.341-345
• /
• 2003

This study develops modeling processes for alignment optimization considering characteristics of intersections using genetic algorithms and GIS for road alignment optimization. Since existing highway alignment optimization models have neglected the characteristics of intersections, they have shown serious weaknesses for real applications. In this paper, intersection costs include earthwork, right-of-way, pavement, accident, delay and fuel consumption costs that are sensitive and dominating to alignments. Also, local optimization of intersections for saving good alignment alternatives is developed and embedded. A highway alignment is described by parametric representation in space and vector manipulation is used to find the coordinates of intersections and other interesting points. The developed intersection cost estimation model is sufficiently precise for estimating intersection costs and eventually enhancing the performance of highway alignment optimization models. Also, local optimization of intersections can be used for improving search flexibility, thus allowing more effective intersections. It also provides a basis for extending the alignment optimization from single highways to networks. The presented two artificial examples show that the total intersection costs are substantial and sensitive to highway alignments.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.4
• /
• pp.689-697
• /
• 2009

We study the existence of surjective morphisms between Fano manifolds of Picard number 1, when the source is given by the intersection of a cubic hypersurface and either a quadric or another cubic hypersurface in a projective space.

• Journal of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.697-709
• /
• 2001

Generalized forms of the von neumann-Sion type minimax theorem, the Fan-Ma intersection theorem, the Fan-a type analytic alternative, and the Nash-Ma equilibrium theorem hold for generalized convex spaces without having any linear structure.