搜尋


目前的篩選器:

開始新的搜尋
新增篩選器:

使用篩選器讓結果更精確。


第 1 到 50 筆結果,共 104 筆。
符合的文件:
日期標題作者全文
1八月-1997The Smallest Pair of Non-crossing Paths in a Rectilinear PolygonC.D.Yang; D.T.Lee; C.K.Wong-
2六月-1978The All Nearest Neighbor Problem for Convex PolygonsD.T.Lee; F.P.Preparata-
31985On Finding the Diameter of a Set of LinesY.T.Ching; D.T.Lee-
41980An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree ProblemJ.M.Smith; D.T.Lee; J.S.Liebman-
5一月-1984On 2-Dimensional Channel Assignment ProblemD.T.Lee; J.Y.T.Leung-
6三月-1986Computational Complexity of Art Gallery ProblemsD.T.Lee; A.K.Lin-
7八月-1989A New Approach to Topological Via MinimizationM.Sarrafzadeh; D.T.Lee-
8一月-1983(g0, g1,..., gk)-Trees and Unary 0L SystemsD.T.Lee; C.L.Liu; C.K.Wong-
91986Computing the Largest Empty RectangleB.Chazelle; R.L.Drysdale; D.T.Lee-
10九月-1990Planar Subset of Multi-terminal NetsK.F.Liao; D.T.Lee; M.Sarrafzadeh-
11六月-1981An On-Chip Compare/Steer Bubble SorterD.T.Lee; H.Chang; C.K.Wong-
121984On Maximum Empty Rectangle ProblemA.Naamad; W.L.Hsu; D.T.Lee-
13七月-1995Finding an Approximate Minimum-Link Visibility Path Inside a Simple PolygonM.H.Alsuwaiyel; D.T.Lee-
141990Parallel Geometric Algorithms on a Mesh Connected ComputerC.S.Jeong; D.T.Lee-
15二月-1984On a Circle-Cover Minimization ProblemC.C.Lee; D.T.Lee-
16九月-1980Quintary Trees: A File Structure for Multidimensional Database SystemsD.T.Lee; C.K.Wong-
17十二月-1990Minimum Cut for Circular-arc GraphsD.T.Lee; M.Sarrafzadeh; Y.F.Wu-
18九月-1989On-Line Bin Packing in Linear TimeP.Ramanan; D.J.Brown; C.C.Lee; D.T.Lee-
19七月-1982Medial Axis Transformation of a Planar ShapeD.T.Lee-
201977Worst Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad TreesD.T.Lee; C.K.Wong-
21二月-1980Voronoi Diagrams in L1 (L∞) Metrics with 2-Dimensional Storage ApplicationsD.T.Lee; C.K.Wong-
22十月-1980Two Dimensional Voronoi Diagrams in the Lp-metricD.T.Lee-
23二月-1981Generalization of Voronoi Diagram in the PlaneD.T.Lee; R.L.Drysdale-
24九月-1977Location of a Point in a Planar Subdivision and Its ApplicationsD.T.Lee; F.P.Preparata-
251981Record Allocation for Minimizing Expected Seek Delay TimeU.I.Gupta; D.T.Lee; J.Y.T.Leung; J.W.Pruitt; C.K.Wong-
26四月-1983On Finding the Convex Hull of a Simple PolygonD.T.Lee-
27十一月-1979An Optimal Solution for the Channel-Assignment ProblemU.I.Gupta; D.T.Lee; J.Y.T.Leung-
281982Efficient Algorithms for Interval Graphs and Circular-arc GraphsU.I.Gupta; D.T.Lee; J.Y.T.Leung-
29四月-1979A Note on the All Nearest Neighbor Problem for Convex PolygonsC.C.Yang; D.T.Lee-
30二月-1998Two Guard Walkability of Simple PolygonsL.H.Tseng; D.T.Lee; P.Heffernan-
31五月-1992An Optimal Algorithm for the Maximum Two-Chain ProblemR.D.Lou; M.Sarrafzadeh; D.T.Lee-
32三月-1996Computational GeometryD.T.Lee-
33四月-1995Dot Pattern Matching in d-DimensionsP.J.deRezende; D.T.Lee-
341989Rectilinear Shortest Paths with Rectangular BarriersRezende, P.J.de; D.T.Lee; Y.F.Wu-
351981Finding Intersection of Rectangles by Range SearchD.T.Lee; C.K.Wong-
361986On a Circle Placement ProblemB.M.Chazelle; D.T.Lee-
37九月-1983Dynamic Voronoi DiagramsI.G.Gowda; D.G.Kirkpatrick; D.T.Lee; A.Naamad-
381985Computing the Relative Neighborhood Graph in the L1-metricD.T.Lee-
39七月-1981Number of Vias: A Control Parameter for Global Wiring of High Density ChipsD.T.Lee; S.J.Hong; C.K.Wong-
40三月-1991Out-of-Roundness Problem RevisitedV.B.Le; D.T.Lee-
41十二月-1989Parallel Batched Planar Point Location on the CCCD.T.Lee; F.P.Preparata-
42七月-1979An Optimal Algorithm for Finding the Kernel of a polygonD.T.Lee; F.P.Preparata-
431981An O(n log n) Heuristic for Steiner Minimal Tree Problems on the Euclidean MetricJ.M.Smith; D.T.Lee; J.S.Liebman-
44十二月-1984Computational Geometry: A SurveyD.T.Lee; F.P.Preparata-
451986Generalized Delaunay Triangulation for Planar GraphsD.T.Lee; A.K.Lin-
46九月-1982An Improved Algorithm for the Rectangle Enclosure ProblemD.T.Lee; F.P.Preparata-
47十一月-1979Location of Multiple Points in Planar SubdivisionD.T.Lee; C.C.Yang-
48十一月-1976An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric FunctionD.T.Lee; S.J.Hong-
49六月-1993Minimal Link Visibility Paths inside a Simple PolygonM.H.Alsuwaiyel; D.T.Lee-
50六月-1995Rectilinear Path Problems among Rectilinear Obstacles RevisitedC.D.Yang; D.T.Lee; C.K.Wong-
第 1 到 50 筆結果,共 104 筆。