DESIGN OF VERTICAL ALIGNMET

Similar documents
VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2

3D vector computer graphics

UNIT 2 : INEQUALITIES AND CONVEX SETS

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Scan Conversion & Shading

Scan Conversion & Shading

USING GRAPHING SKILLS

TEST-05 TOPIC: OPTICS COMPLETE

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

Research on laser tracker measurement accuracy and data processing. Liang Jing IHEP,CHINA

Product Information. XY compensation unit with spring return AGE-F

Local and Global Accessibility Evaluation with Tool Geometry

Lecture #15 Lecture Notes

Slide 1 SPH3UW: OPTICS I. Slide 2. Slide 3. Introduction to Mirrors. Light incident on an object

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

Parallelism for Nested Loops with Non-uniform and Flow Dependences

A high precision collaborative vision measurement of gear chamfering profile

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Algorithm To Convert A Decimal To A Fraction

Airport Engineering Lectures

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

Cable optimization of a long span cable stayed bridge in La Coruña (Spain)

A DATA ANALYSIS CODE FOR MCNP MESH AND STANDARD TALLIES

GIS: data processing Example of spatial queries. 3.1 Spatial queries. Chapter III. Geographic Information Systems: Data Processing

Parallel matrix-vector multiplication

Geo-spatial Information Science 13(3): Volume 13, Issue 3 DOI /s September Article ID: (2010)

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Support Vector Machines

Alufix Expert D Design Software #85344

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Dynamic wetting property investigation of AFM tips in micro/nanoscale

FIBARO WALL PLUG OPERATING MANUAL FGBWHWPE-102/FGBWHWPF-102 CONTENTS

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

TN348: Openlab Module - Colocalization

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

A Binarization Algorithm specialized on Document Images and Photos

Accessibility Analysis for the Automatic Contact and Non-contact Inspection on Coordinate Measuring Machines

On Some Entertaining Applications of the Concept of Set in Computer Science Course

Modeling Concave Globoidal Cam with Swinging Roller Follower: A Case Study

Contours Planning and Visual Servo Control of XXY Positioning System Using NURBS Interpolation Approach

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)

3-Wheel Swerve Drive - The Trouble with Tribots

Assembler. Building a Modern Computer From First Principles.

Dimensions of spline spaces over non-rectangular T-meshes

Feature Estimation and Registration of Point Clouds in Reverse Engineering

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

Any Pair of 2D Curves Is Consistent with a 3D Symmetric Interpretation

Classifier Selection Based on Data Complexity Measures *

VECTOR - RASTER CONVERSION

Load Balancing for Hex-Cell Interconnection Network

PARTITIONING POSITIONAL AND NORMAL SPACE FOR FAST OCCLUSION DETECTION

The example below contains two doors and no floor level obstacles. Your panel calculator should now look something like this: 2,400

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

CSE 326: Data Structures Quicksort Comparison Sorting Bound

Distribution Analysis

MIKE ZERO: Creating 2D Bathymetries. Bathymetry Editor & Mesh Generator. Scientific Documentation

AADL : about scheduling analysis

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

A Range Image Refinement Technique for Multi-view 3D Model Reconstruction

IP Camera Configuration Software Instruction Manual

Double Layer Tensegrity Grids

CHAPTER 2 DECOMPOSITION OF GRAPHS

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane

DECISION HELP SYSTEM SUPPORTED DATA-MINING METHOD

Routability Driven Modification Method of Monotonic Via Assignment for 2-layer Ball Grid Array Packages

Snakes-based approach for extraction of building roof contours from digital aerial images

Form-factors Josef Pelikán CGG MFF UK Praha.

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Welcome to the Three Ring %CIRCOS: An Example of Creating a Circular Graph without a Polar Axis

VOXEL BASED SEGMENTATION OF LARGE AIRBORNE TOPOBATHYMETRIC LIDAR DATA

Programming Assignment Six. Semester Calendar. 1D Excel Worksheet Arrays. Review VBA Arrays from Excel. Programming Assignment Six May 2, 2017

Reading. 14. Subdivision curves. Recommended:

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Chapter 26: Geometrical Optics

9. BASIC programming: Control and Repetition

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation

Hierarchical clustering for gene expression data analysis

Biostatistics 615/815

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Visual Curvature. 1. Introduction. y C. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), June 2007

A Gradient Difference based Technique for Video Text Detection

The Evaluation and Correction of the Reconstructed NURBS Surface Smoothing and Accuracy

VFH*: Local Obstacle Avoidance with Look-Ahead Verification

A Gradient Difference based Technique for Video Text Detection

Interpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces

Solving some Combinatorial Problems in grid n-ogons

Sixth-Order Difference Scheme for Sigma Coordinate Ocean Models

Real-time Scheduling

11. HARMS How To: CSV Import

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Calibration Method for 2-Dimensional Laser Scanner Attached on a Robot Vehicle

cos(a, b) = at b a b. To get a distance measure, subtract the cosine similarity from one. dist(a, b) =1 cos(a, b)

Electrical analysis of light-weight, triangular weave reflector antennas

Transcription:

DESIN OF VERTICAL ALINMET Longtudnal gradent : max 0,5% (max see the assgnment paper) Markng of longtudnal gradent n drecton of chanage: + [%].. ascent n the drecton of chanage [%].. descent n the drecton of chanage Resultng gradent m (must be verfed at each pont of the road values of mmax for hlly terran): M S 2 category S 6,5 and S 7,5... M Mmax 8,5% category S 9,5 and S 11,5... M M max 7,5% permtted mnmum value... M Mmn 0,3% recommended mnmum value... M Mmn 0,5% DESIN OF VERTICAL ALINMENT LONITUDINAL PROFILE (1 : 1 000 / 100) Process of plottng the frst phase - see fg. 0100: axs (black) vertcal and horzontal (ncludng the descrpton of the chanage every 100 m 0.1;... 0.3;...) choce of reference plane (at least 8 m below the lowest ntersected contour lne respect the scale!!!) plottng the terran lne n ponts every 10 m determne the elevaton of each pont by nterpolaton from 2

dmensons n fg. 0110 whch are measured perpendcularly to the contour lnes: dmenson B measured to the lower contour lne dmenson C measured to the hgher contour lne example from fg. 0110: terran elevaton [m] = lower contour lne + [B / (B + C)] Fg. 0110 (determnng the elevaton of a pont at the centre lne n the plan)

Fg. 0100 (longtudnal profle frst phase of plottng) plottng vertces of elevaton polygon at frst (example n fg. 0120) accordng to the followng prncples: ponts A and B have the same elevaton as the terran lne

vertcal algnment desgned wthout gradent lost (example of poor desgn n fg. 0130) fll (embankment) = vertcal algnment terran 10 m cut (excavaton) = terran vertcal algnment 6 m (wthout the need of geologcal assessment) other vertces (PVI1, PVI2,...) choose reasonably (take nto account the maxmum flls and cuts to balance the earthworks) Fg. 0120 (desgn of elevaton polygon and vertcal curves) Fg. 0130 (poor vertcal algnment desgn wth gradent lost and wthout possblty of full dranage)

read coordnates of vertces PVI of elevaton polygon: PVI = [chanage (St); elevaton (H)] [St] = km (5 decmal places) [H] = m (2 decmal places) calculate longtudnal gradents between each 2 vertces and +1 (at least 2 decmal places!!!) % 100 1000 H St 1 1 H St 10 H 1 St H 1 St verfy between all vertces PVI and PVI+1 : 0,5% max Vertcal curves vertcal curves are parabolc (dstorted): sag curve (concave) radus Rs crest curve (convex) radus Rc (stoppng sght Rc Rc,mn) add the mnmum rad of vertcal curves to the techncal report: Rc,mn... accordng to V from fg. 0140 and fg. 0150 (the smallest possble for stoppng sght) Rs,mn... accordng to V from fg. 0160 and fg. 0170 (the smallest allowed) Rs,mn and Rc,mn must be respected n the desgn!

Fg. 0140 (scheme of crest curves) Fg. 0150 (mnmum rad of crest curves) Fg. 0160 (scheme of sag curves) Fg. 0170 (mnmum rad of sag curves)

Insert and calculate vertcal curves (dmensons accordng to fg. 0180): Fg. 0180 (vertcal curve basc dmensons) Fg. 0181 (vertcal curve termnology)

Recommended procedure select t calculate Rs(c) accordng to the followng formulas: a) One-sded gradents (fg. 0190 and fg. 0200) t R s(c) 1 R 200 200 t 1 s(c) Fg. 0190 a fg. 0200 (vertcal curve one-sded gradents) b) Opposte drecton gradents (fg. 0210) t R s(c) 1 R 200 200 t 1 s(c) Fg. 0210 (vertcal curve opposte drecton gradents)

verfy (for all vertcal curves): R or R c R c, mn s R s,mn Rs or Rc desgn the greatest possble Formula for vertcal coordnate y of any pont of vertcal curve: 2 2 x t y ymax 2 R 2 R s(c) Process of plottng the second phase fg. 0100, fg. 0240 and fg. 0250: Markng of gradents and vertcal algnment (ncludng chanage of all ponts A, BVC, PVI, EVC, B) fll n all the values accordng to the examples n fg. 0100, fg. 0240 and fg. 0250 Markng of horzontal algnment: Pay attenton to dfferent schemes for left-sded (fg. 0220) and rght-sded (fg. 0230) horzontal curve Descrpton of horzontal curves (R, c, L fg. 0240), transton curves (L, A fg. 0250), straght secton (L fg. 0250) and 6 ponts (A, TS, SC, CS, ST, B fg. 0100 and fg. 0250) s(c) Fg. 0220 (scheme for leftsded curve) Fg. 0230 (scheme for rghtsded curve)

Fg. 0240 (longtudnal profle example of central part)

Fg. 0250 (longtudnal profle example of the end part)

Preparaton for cross-sectons, descrpton of vertcal axs (fg. 0100) measure terran elevaton (wth an accuracy of 2 decmal places) fll n accordng to the example n fg. 0250: In ponts A, BVC, PVI, EVC, B In ponts TS, SC, CS, ST In all ponts every 20 m Elaboraton of longtudnal profle 2 optons: (On graph paper) On a computer n CAD Colours n longtudnal profle fg. 0100: 1. black: vertcal and horzontal axs man chanage every 100 m (0.0; 0.4;...) base lne terran lne elevatons terran lne 2. red everythng else