• 대한수학회지
• /
• 제32권3호
• /
• pp.371-387
• /
• 1995

Let X be a compact polyhedron, H a normal subgroup of the fundamental group $\pi_1(X)$ of X and $f : X \longrightarrow X$ a selfmap such that $f_piH \subset H$, where f_\pi : \pi_1(X) \longrightarrow \pi_1(X)$ is the induced homomorphism by f.

• 대한수학회논문집
• /
• 제14권2호
• /
• pp.337-352
• /
• 1999

In this paper we find a geometric condition for the weaker principle of spatial averaging (PSA) for a class of polyhedral domains. Let \ulcorner be a polyhedron in R\ulcorner, n$\leq$3. If all dihedral angles of \ulcorner are submultiples of $\pi$, then there exists a parallelopiped \ulcorner generated by n linearily independent vectors {\ulcorner}\ulcorner in R\ulcorner containing \ulcorner so that solutions of $\Delta$u+λu=0 in \ulcorner with either the boundary condition u=0 or ∂u/∂n=0 are expressed by linear combinations of those of $\Delta$u+λn=0 in \ulcorner with periodic boundary condition. Moreover, if {\ulcorner}\ulcorner satisfies rational condition, we guarantee the weaker PSA for the domain \ulcorner.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제6권2호
• /
• pp.1-9
• /
• 1968

In mathematics, a definition must have authentic reasons to be defined so. On defining geometric figures, there must be adequencies in sequel and consistency in the concepts of figures, though the dimensions of them are different. So we can avoid complicated thoughts from the study of geometric property. From the texts of SMSG, UICSM and others, we can find easily that the same concepts are not kept up on defining some figures such as ray and segment on a line, angle and polygon on a plane, and polyhedral angle and polyhedron on a 3-dimensionl space. And the measure of angle is not well-defined on basis of measure theory. Moreover, the concepts for interior, exterior, and frontier of each figure used in these texts are different from those of general topology and algebraic topology. To avoid such absurdness, I myself made new terms and their definitions, such as 'gan' instead of angle, 'polygonal region' instead of polygon, and 'polyhedral solid' instead of polyhedron, where each new figure contains its interior. The scope of this work is hmited to the fundamental idea, and it merely has dealt with on the concepts of measure, dimension, and topological property. In this case, the measure of a figure is a set function of it, so the concepts of measure is coincided with that of measure theory, and we can deduce the topological property for it from abstract stage. It also presents appropriate concepts required in much clearer fashion than traditional method.

• 한국CDE학회논문집
• /
• 제11권6호
• /
• pp.455-463
• /
• 2006

Hidden line removal(HLR) algorithms can be devised either in the image space or in the object space. This paper describes a hidden line removal algorithm in the object space specifically for the CAD viewer data. The approach is based on the Appel's 'Quantitative Invisibility' algorithm and fundamental concept of 'back face culling'. Input data considered in this algorithm can be distinguished from those considered for HLR algorithm in general. The original QI algorithm can be applied for the polyhedron models. During preprocessing step of our proposed algorithm, the self intersecting surfaces in the view direction are divided along the silhouette curves so that the QI algorithm can be applied. By this way the algorithm can be used for any triangulated freeform surfaces. A major advantage of this algorithm is the applicability to general CAD models and surface-based visualization data.