• 대한수학회보
• /
• 제32권2호
• /
• pp.215-219
• /
• 1995

The most fundamental examples of (combinatorial) geometries are projective geometries PG(n - 1,q) of dimension n - 1, representable over GF(q), where q is a prime power. Every upper interval of a projective geometry is a projective geometry. The Whitney numbers of the second kind are Gaussian coefficients. Every flat of a projective geometry is modular, so the projective geometry is supersolvable in the sense of Stanley [6].

• 한국수학사학회지
• /
• 제15권1호
• /
• pp.1-14
• /
• 2002

This paper treats the history of the fundament of projective geometry Especially we introduce the essence of the framework of Karl Chirstian von Staudt's ‘Geometrie der Lage’. Von Staudt used axiomatical method to bum the system of the projective geometry, and proved the fundamental theorem of projective geometry. And he handled imaginary elements (or the first time in synthetic projective geometry.

• 대한수학회지
• /
• 제33권4호
• /
• pp.1139-1171
• /
• 1996

The purpose of our research is to understand geometric and topological aspects of real projective structures on surfaces. A real projective surface is a differentiable surface with an atlas of charts to $RP^2$ such that transition functions are restrictions of projective automorphisms of $RP^2$. Since such an atlas lifts projective geometry on $RP^2$ to the surface locally and consistently, one can study the global projective geometry of surfaces.

• Journal of the Korean Statistical Society
• /
• 제35권1호
• /
• pp.49-61
• /
• 2006

Wu et al. (1992) constructed some general classes of tight asymmetric orthogonal arrays of strength 2 using the method of grouping. Rains et al. (2002) obtained asymmetric orthogonal arrays of strength 2 using the concept of mixed spread in finite projective geometry. In this paper, we obtain some new tight asymmetric orthogonal arrays of strength 2 using the concept of mixed partition in finite projective geometry.

• Kyungpook Mathematical Journal
• /
• 제1권1호
• /
• pp.1-15
• /
• 1958

• 한국수학사학회지
• /
• 제18권4호
• /
• pp.29-38
• /
• 2005

이 논문에서는 고대 그리스 시대부터 비롯되었던 논리 전개 방식 토는 발견술에서 출발하여 19세기 사영기하학의 방법론에 이르기까지 종합법과 해석법의 대립을 다룬다. 애초에 발견술로서 차이를 드러냈던 두 방법은 출발 자체가 주로 기하학영역에서 비롯되었듯이 18세기에 이르러 기하학의 양대 분야, 즉 해석기하학과 종합기하학으로까지 나뉘게 되는 토대를 제공한다. 19세기에 이르러서는 사영기하학 내부에서 수학의 본성에 대하여 다른 관점을 가지는 데서 야기된 대립 양상까지 보이게 된다 그렇지만 결국 양자의 변증법적 지양을 도모했던 고대에서와 마찬가지로 더 이상 대립의 근거가 없어지기에 이르는 과정을 밝힌다.

• 대한수학회보
• /
• 제54권5호
• /
• pp.1743-1755
• /
• 2017

Let B be a simply-connected projective variety such that the first cohomology groups of all line bundles on B are zero. Let E be a vector bundle over B and $X={\mathbb{P}}(E)$. It is easily seen that a power of any endomorphism of X takes fibers to fibers. We prove that if X admits an endomorphism which is of degree greater than one on the fibers, then E splits into a direct sum of line bundles.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.391-394
• /
• 2005

In this paper, we present an approach that is able to reconstruct 3 dimensional metric models from un-calibrated images acquired by a freely moved camera system. If nothing is known of the calibration of either camera, nor the arrangement of one camera which respect to the other, then the projective reconstruction will have projective distortion which expressed by an arbitrary projective transformation. The distortion on the reconstruction is removed from projection to metric through self-calibration. The self-calibration requires no information about the camera matrices, or information about the scene geometry. Self-calibration is the process of determining internal camera parameters directly from multiply un-calibrated images. Self-calibration avoids the onerous task of calibrating cameras which needs to use special calibration objects. The root of the method is setting a uniquely fixed conic(absolute quadric) in 3D space. And it can make possible to figure out some way from the images. Once absolute quadric is identified, the metric geometry can be computed. We compared reconstruction image from calibrated images with the result by self-calibration method.

• 대한수학회보
• /
• 제54권4호
• /
• pp.1095-1110
• /
• 2017

The t-wise intersection is a useful property of a linear code due to its many applications. Recently, the second author determined the t-wise intersection of a relative two-weight code. By using this result and generalizing the finite projective geometry method, we will present the t-wise intersection of a relative three-weight code and its applications in this paper.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 제37회 하계학술대회 논문집 D
• /
• pp.1958-1959
• /
• 2006

This paper proposes a local path-planning algorithm that enables a mobile robot with vision sensor in a local area.The proposed method based on projective geometry and a wavefront method finds local-paths to avoid collisions using 3-D walls or obstacles map generated using projective geometry. Simulation results show the feasibility of the proposed method