G. Weber, L. Knipping, H. Alt, An Application of Point Pattern Matching in Astronautics, Journal of Symbolic Computation 17 (1994) 321--340  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Approximate Geometric Pattern Matching under Rigid Motions - Goodrich, Mitchell, Orletsky (1994) (1 citation) (Correct)
....pattern and the points in the background has already been established. The Extracted Information Approach. Another general strategy, which we call the extracted information approach, attempts to match the pattern to the background based on information extracted from the sets of points. See, e.g. [2, 4, 17, 19, 32]. As shown by the authors, these methods work very well, theoretically and experimentally, for patterns and backgrounds that are related to each other by certain, sometimes strict, criteria. These methods do not, in general, work very well for the cases of missing points, and in some cases, the ....
H. Alt, L. Knipping, and G. Weber. An application of point pattern matching in astronautics. Technical Report B-93-16, Institut fur Informatik, Fachbereich Mathematik und Informatic, Freie Universitat Berlin, Takustr. 9, D-14195, Berlin, 1993.
An Efficient and Effective Approximation Algorithm for the Map .. - Wagner, Wolff (1995) (3 citations) (Correct)
.... The simplest of the heuristics, H, is used by the City of M unchen for the application mentioned above, by the PTT Research Labs of the Netherlands to produce on line maps for mobile radio networks, and in a computer system for the automated search for matching constellations in a star catalogue [WKA94] as a tool to label the output on the screen. With a very similar algorithmic approach Formann and Wagner [FW] were able to solve the so called METAFONT labeling problem posed by Knuth and Raghunathan [KR92] The main contribution of this paper is the integration of the two parts of the hybrid ....
G. Weber, L. Knipping, H. Alt, An Application of Point Pattern Matching in Astronautics, Journal of Symbolic Computation 17 (1994) 321--340
A Practical Map Labeling Algorithm - Wagner, Wolff (1997) (1 citation) (Correct)
.... The simplest of the heuristics, H , is used by the City of Munich for the application mentioned above, by the PTT Research Labs of the Netherlands to produce on line maps for mobile radio networks, and in a computer system for the automated search for matching constellations in a star catalogue [15] as a tool to label the output on the screen. With a very similar algorithmic approach Formann and Wagner [5] were able to solve the so called METAFONT labeling problem posed by Knuth and Raghunathan [7] In this paper we integrate the two parts of the hybrid method into a provably good and ....
G. Weber, L. Knipping, H. Alt, An Application of Point Pattern Matching in Astronautics, Journal of Symbolic Computation 17 (1994) 321--340 # of points 0 100 200 300 400 500 600 700 800 900 1000
Map Labeling - Wolff (1995) (2 citations) (Correct)
.... The simplest of the heuristics, H , is used by the City of Munich for the application mentioned above, by the PTT Research Labs of the Netherlands to produce on line maps for mobile radio networks, and in a computer system for the automated search for matching constellations in a star catalogue [WKA94] as a tool to label the output on the screen. With a very similar algorithmic approach Formann and Wagner [FW] were able to solve the so called METAFONT labeling problem posed by Knuth and Raghunathan [KR92] In Chapter 2 we integrate the two parts of the hybrid method into a provably good and ....
G. Weber, L. Knipping, H. Alt, An Application of Point Pattern Matching in Astronautics, Journal of Symbolic Computation 17 (1994) 321--340
Map Labeling Heuristics: Provably Good and Practically Useful - Wagner, Wolff (1995) (15 citations) (Correct)
....two. The simplest of these heuristics is used by the City of M unchen for the application mentioned above, by the PTT Research Labs of the Netherlands to produce online maps for mobile radio networks, and in a computer system for the automated search for matching constellations in a star catalogue [11] as a tool to label the output on the screen. With a very similar algorithmic approach we were able to solve the so called METAFONT labeling problem posed by Knuth and Raghunathan [6] 2 Description of the Heuristics 2.1 A Theoretical Foundation Definition 1 For a point p in the plane denote ....
G. Weber, L. Knipping, H. Alt, An Application of Point Pattern Matching in Astronautics, Journal of Symbolic Computation 17 (1994) 321--
Map Labeling - Wolff (1995) (2 citations) (Correct)
No context found.
G. Weber, L. Knipping, H. Alt, An Application of Point Pattern Matching in Astronautics, Journal of Symbolic Computation 17 (1994) 321--340
A Sweep Line Algorithm for Nearest Neighbour Queries - Joao Dinis Departamento (Correct)
No context found.
G. Weber, L. Knipping, and H. Alt. An application of point pattern matching in astronautics. Journal of Symbolic Computation, 11:1--20, 1994.
Fast and Reliable Map Labeling - Wagner, Wolff (1995) (Correct)
No context found.
G. Weber, L. Knipping, H. Alt, An Application of Point Pattern Matching in Astronautics, Journal of Symbolic Computation 17 (1994) 321--340
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC