MEDIAL AXIS TRANSFORMATION OF A PLANAR SHAPELEE DT.1982; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 4; PP. 363-369; BIBL. 15 REF.Article

UNIFIED DATABASE FOR DECISION SUPPORTLEE DT.1982; INTERNATIONAL JOURNAL OF POLICY ANALYSIS AND INFORMATION SYSTEMS; ISSN 0195-9301; USA; DA. 1982; VOL. 6; NO 3; PP. 245-271; BIBL. 45 REF.Article

VISIBILITY OF A SIMPLE POLYGONLEE DT.1983; COMPUTER VISION, GRAPHICS, AND IMAGE PROCESSING; ISSN 51361X; USA; DA. 1983; VOL. 22; NO 2; PP. 207-221; BIBL. 5 REF.Article

TWO-DIMENSIONAL VORONOI DIAGRAMS IN THE L_P-METRICLEE DT.1980; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1980; VOL. 27; NO 4; PP. 604-618; BIBL. 17 REF.Article

VORONOI DIAGRAMS IN L1 (LINFINI) METRICS WITH 2-DIMENSIONAL STORAGE APPLICATIONSLEE DT; WONG CK.1980; S.I.A.M. J. COMPUTG; USA; DA. 1980; VOL. 9; NO 1; PP. 200-211; BIBL. 23 REF.Article

LOCATION OF MULTIPLE POINTS IN A PLANAR SUBDIVISIONLEE DT; YANG CC.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 4; PP. 190-193; BIBL. 13 REF.Article

TWO ALGORITHMS FOR CONSTRUCTING A DELAUNAY TRIANGULATIONLEE DT; SCHACHTER BJ.1980; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1980; VOL. 9; NO 3; PP. 219-242; BIBL. 37 REF.Article

AN OPTIMAL ALGORITHM FOR FINDING THE KERNEL OF A POLYGONLEE DT; PREPARATA FP.1979; J. ASS. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 3; PP. 415-421; BIBL. 1 REF.Article

THE ALL NEAREST-NEIGHBOR PROBLEM FOR CONVEX POLYGONSLEE DT; PREPARATA FP.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 4; PP. 189-192; BIBL. 4 REF.Article

AN IMPROVED ALGORITHM FOR THE RECTANGLE ENCLOSURE PROBLEMLEE DT; PREPARATA FP.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 3; PP. 218-224; BIBL. 7 REF.Article

QUINTARY TREES: A FILE STRUCTURE FOR MULTIDIMENSIONAL DATABASE SYSTEMSLEE DT; WONG CK.1980; A.C.M. TRANS-DATABASE SYST.; USA; DA. 1980; VOL. 5; NO 3; PP. 339-353; BIBL. 16 REF.Article

A NOTE ON THE ALL NEAREST-NEIGHBOR PROBLEM FOR CONVEX POLYGONSYANG CC; LEE DT.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 193-194; BIBL. 3 REF.Article

WORT-CASE ANALYSIS FOR REGION AND PARTIAL REGION SEARCHES IN MULTIDIMENSIONAL BINARY SEARCH TREES AND BALANCED QUAD TREES.LEE DT; WONG CK.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 9; NO 1; PP. 23-29; BIBL. 5 REF.Article

FINDING INTERSECTION OF RECTANGLES BY RANGE SEARCHLEE DT; WONG CK.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 4; PP. 337-347; BIBL. 16 REF.Article

LOCATION OF A POINT IN A PLANAR SUBDIVISION AND ITS APPLICATIONS.LEE DT; PREPARATA FP.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 3; PP. 594-606; BIBL. 4 REF.Article

AN OPTIMAL ILLUMINATION REGION ALGORITHM FOR CONVEX POLYGONSLEE DT; SILIO CB JR.1982; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1982; VOL. 31; NO 12; PP. 1225-1227; BIBL. 10 REF.Article

GENERALIZATION OF VORONOI DIAGRAMS IN THE PLANELEE DT; DRYSDALE RL III.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 1; PP. 73-87; BIBL. 22 REF.Article

AN ALGORITHM FOR TRANSFORMATION OF AN ARBITRARY SWITCHING FUNCTION TO A COMPLETELY SYMMETRIC FUNCTION.LEE DT; SE JUNE HONG.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 11; PP. 1117-1123; BIBL. 8 REF.Article

A STUDY OF CHARACTERISTICS OF DEVELOPING, INCOMPRESSIBLE, AXI-SYMMETRIC JETS.HRYCAK P; JACHNA S; LEE DT et al.1974; LETTERS HEAT MASS TRANSFER; G.B.; DA. 1974; VOL. 1; NO 1; PP. 63-71; BIBL. 9 REF.Article

RANKING AND UNRANKING OF B-TREESGUPTA UI; LEE DT; WONG CK et al.1983; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1983; VOL. 4; NO 1; PP. 51-60; BIBL. 18 REF.Article

EFFICIENT ALGORITHMS FOR INTERVAL GRAPHS AND CIRCULAR-ARC GRAPHSGUPTA UI; LEE DT; LEUNG JYT et al.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 4; PP. 459-467; BIBL. 13 REF.Article

NUMBER OF VIAS: A CONTROL PARAMETER FOR GLOBAL WIRING OF HIGH-DENSITY CHIPSLEE DT; HONG SJ; WONG CK et al.1981; IBM J. RES. DEVELOP.; ISSN 0018-8646; USA; DA. 1981; VOL. 25; NO 4; PP. 261-271; BIBL. 5 REF.Article

AN O(N LOG N) HEURISTIC FOR STEINER MINIMAL TREE PROBLEMS ON THE EUCLIDEAN METRICSMITH JM; LEE DT; LIEBMAN JS et al.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 1; PP. 23-39; BIBL. 25 REF.Article

AN OPTIMAL SOLUTION FOR THE CHANNEL-ASSIGNMENT PROBLEMGUPTA UI; LEE DT; LEUNG JYT et al.1979; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS/1979-03-28/BALTIMORE MD; USA; BALTIMORE: THE JOHNS HOPKINS UNIVERSITY; DA. 1979; PP. 66-69; BIBL. 6 REF.Conference Paper

(G₀, G₁,..., G_K)-TREES AND UNARY OL SYSTEMSLEE DT; LIU CL; WONG CK et al.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 22; NO 1; PP. 209-217; BIBL. 9 REF.Article