A Buffer Zone Computation Algorithm for Corridor Rendering in GIS

Date

2009-09-16

Author

Er, Emre
Kilinc, Ismail
Gezici, Goerkem
Baykal, Buyurman

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

111
views

0
downloads

This work defines a corridor rendering algorithm with variable leg buffer distances and the algorithm also supports geographic world model. A corridor is defined by a path and two distances for each leg to make a buffered zone around the path. Rendering of a corridor is a challenging task in GIS applications. Corridor is extensively used on mission computer displays on command and control platforms and civilian air control centers. Line buffering [1] and offset curve [2] approximations are the special case for the corridor in which there is a constant buffer distance for each leg whereas a corridor may have different leg distances. There are various works about line buffering and offset curve approximations but no algorithm is found in literature for corridor problem.

Subject Keywords

GIS, Rendering, Corridor, Navigation route, Offset curve, Buffer zone

URI

https://hdl.handle.net/11511/54228

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

A new anisotropic perfectly matched layer medium for mesh truncation in finite difference time domain analysis Tong, MS; Chen, YC; Kuzuoğlu, Mustafa; Mittra, R (1999-09-01) In this paper an unsplit anisotropic perfectly matched layer (PML) medium, previously utilized in the context of finite element analysis, is implemented in the finite difference time domain (FDTD) algorithm. The FDTD anisotropic PML is easy to implement in the existing FDTD codes, and is well suited for truncating inhomogeneous and layered media without special treatment required in the conventional PML approach. A further advantage of the present approach is improved performance at lower frequencies. The a...
A 2-0 navier-stokes solution method with overset moving grids Tuncer, İsmail Hakkı (1996-01-01) A simple, robust numerical algorithm to localize moving boundary points and to interpolate uniteady solution variables across 2-D, arbitrarily overset computational grids is presented. Overset grids are allowed to move in time relative to each other. The intergrid boundary points are localized in terms of three grid points on the donor grid by a directional search algorithm. The parameters of the search algorithm give the interpolation weights at the localized boundary point. The method is independent of nu...
A genetic algorithm for 2d shape optimization Chen, Wei Hang; Oral, Süha; Department of Mechanical Engineering (2008) In this study, an optimization code has been developed based on genetic algorithms associated with the finite element modeling for the shape optimization of plane stress problems. In genetic algorithms, constraints are mostly handled by using the concept of penalty functions, which penalize infeasible solutions by reducing their fitness values in proportion to the degrees of constraint violation. In this study, An Improved GA Penalty Scheme is used. The proposed method gives information about unfeasible ind...
A 2-D unsteady Navier-Stokes solution method with overlapping/overset moving grids Tuncer, İsmail Hakkı (1996-01-01) A simple, robust numerical algorithm to localize intergrid boundary points and to interpolate unsteady solution variables across 2-D, overset/overlapping, structured computational grids is presented. Overset/ overlapping grids are allowed to move in time relative to each other. The intergrid boundary points are localized in terms of three grid points on the donor grid by a directional search algorithm. The final parameters of the search algorithm give the interpolation weights at the interpolation point. Th...
A Customized force-directed layout algorithm for biological graphs whose vertices have enzyme commission attributes Danacı, Hasan Fehmi; Atalay, Mehmet Volkan; Department of Computer Engineering (2015) Force directed layout algorithm is popularly used to draw biological graphs. However, it employs only graph structure. When we would like to embed domain-specific knowledge, such as biological or chemical attributes related to the vertices, force directed layout algorithm should be modified. It is then important to draw more readable layouts for biologists without the dispose of aesthetically pleasing way that comes from force-directed algorithm’s nature. This thesis aims to describe a modified and improved...

Citation Formats

E. Er, I. Kilinc, G. Gezici, and B. Baykal, “A Buffer Zone Computation Algorithm for Corridor Rendering in GIS,” 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/54228.