Douglas–Peucker algorithm ye kaise decide karta hai ki kaunse points rakhne hain?

Ye ek segment ke endpoints ke beech ek chord draw karta hai, us chord se sabse door wala vertex dhoondhta hai, aur ise sirf tab rakhta hai jab uski distance tolerance se zyada ho — phir dono halves par recurse karta hai. Bachne wale exactly wahi vertices hain jo aapke scale par line ko shape dete hain.

GPS tracks ke liye kaunsi tolerance use karein?

Consumer GPS waise hi 3–10 m wander karta hai, isliye 10 m ki tolerance mostly noise hi remove karti hai. Street-level display kareeb 20 m tak hold karti hai; regional overviews 100 m ya zyada tolerate karte hain.

Kya simplification mere polygons todegi?

Guards classic failures rokte hain: closing point preserve hota hai, aur rings jo char positions se neeche gir jaate wo unchanged rehti hain. Aggressive tolerance par tortured shapes mein self-intersection phir bhi possible hai — extreme reductions ko visually inspect karein.

Degrees ki jagah metres mein simplify kyun karein?

Longitude ka degree latitude ke saath shrink hota hai — equator par 111 km, 60°N par 55 km. Raw degree tolerance Scandinavian data ko double aggressively simplify karti. cos(latitude) se scale karna tolerance ko physically meaningful rakhta hai.

GeoJSON Simplify

Dense GeoJSON lines aur polygons ko Douglas–Peucker aur metre-based tolerance se thin karein — aksar 80–95% chota, dikhne mein koi farak nahin.

GeoJSON Simplify poori tarah aapke browser mein chalta hai. Aapka geodata device par process hota hai aur kabhi upload nahin hota.

GeoJSON Viewer kholein

GeoJSON Simplify ke baare mein

GeoJSON Simplify aapke data ki har LineString, MultiLineString, Polygon aur MultiPolygon par Ramer–Douglas–Peucker algorithm chalata hai. Algorithm ek vertex tabhi rakhta hai jab usse hataana shape ko aapki tolerance se zyada move kare — yahan metres mein express hoti hai, aur longitude latitude se sahi tarike se scale hoti hai, isliye tolerance ka matlab Oslo mein wahi hai jo Singapore mein. Har second record hone wale GPS tracks aur survey-precision par digitize ki gayi boundaries routinely map scale par bina visible change ke 80 se 95% tak shrink ho jaate hain. Structure intact rehti hai: rings closed rehti hain, polygons kam-se-kam char positions rakhte hain, points aur properties bina touch huye pass hoti hain, aur original object kabhi mutate nahin hota.

Features

Metre-based tolerance slider ke saath Douglas–Peucker
Latitude-aware scaling, taaki metres har jagah metres rahein
LineString, Polygon aur unke Multi* variants handle karta hai
FeatureCollections aur GeometryCollections recursively walk hoti hain
Rings closed rehti hain aur kabhi valid polygon se neeche collapse nahin hotin
Point counts, reduction percentage aur byte sizes report hote hain

GeoJSON Simplify kaise use karein

GeoJSON paste karein ya sample load karein
Tolerance set karein — street-level ke liye 5–20 m, country shapes ke liye 100 m+
Reduction stats check karein aur output eyeball karein
Simplified GeoJSON copy karein

Example

Input

GPS running track, 4,812 points, 512 KB

Output

10 m tolerance → 214 points, 24 KB — 95.6% fewer points

Map par indistinguishable; bees guna tez load hota hai.

Common errors aur troubleshooting

Simplified shape visibly corners kaat rahi hai. — Tolerance aapke zoom level ke liye zyada bada hai. Tab tak half karte jaayein jab tak artefacts gayab na ho jaayein — sweet spot wo largest tolerance hai jiska output abhi bhi identical lage.
Zero points remove hue. — Data shayad tolerance ke relative pehle se hi coarse hai. Tolerance badhaayein, aur yaad rakhein ki Points kabhi touch nahin hote — sirf lines aur rings mein vertices bachaane ke liye hote hain.
Do adjacent polygons ab exact border share nahin karte. — Har ring independently simplify hoti hai, isliye shared edges thoda diverge kar sakti hain. Strict topology ke liye topology-aware pipeline use karein; display layers ke liye gaps subpixel hote hain.

Aksar pooche jaane wale sawaal

Douglas–Peucker algorithm ye kaise decide karta hai ki kaunse points rakhne hain?: Ye ek segment ke endpoints ke beech ek chord draw karta hai, us chord se sabse door wala vertex dhoondhta hai, aur ise sirf tab rakhta hai jab uski distance tolerance se zyada ho — phir dono halves par recurse karta hai. Bachne wale exactly wahi vertices hain jo aapke scale par line ko shape dete hain.
GPS tracks ke liye kaunsi tolerance use karein?: Consumer GPS waise hi 3–10 m wander karta hai, isliye 10 m ki tolerance mostly noise hi remove karti hai. Street-level display kareeb 20 m tak hold karti hai; regional overviews 100 m ya zyada tolerate karte hain.
Kya simplification mere polygons todegi?: Guards classic failures rokte hain: closing point preserve hota hai, aur rings jo char positions se neeche gir jaate wo unchanged rehti hain. Aggressive tolerance par tortured shapes mein self-intersection phir bhi possible hai — extreme reductions ko visually inspect karein.
Degrees ki jagah metres mein simplify kyun karein?: Longitude ka degree latitude ke saath shrink hota hai — equator par 111 km, 60°N par 55 km. Raw degree tolerance Scandinavian data ko double aggressively simplify karti. cos(latitude) se scale karna tolerance ko physically meaningful rakhta hai.

Related tools

GeoJSON Viewer — GeoJSON ko validate karein aur map par preview karein, feature summary aur bounding box ke saath.
GeoJSON Bounding Box — Kisi bhi GeoJSON ka bbox, centre, area aur length dono orders mein.
GPX se GeoJSON — GPX ko GeoJSON mein aur wapas convert karein — GPS tracks, routes aur waypoints ko GeoJSON features, ya GeoJSON ko wapas GPX file mein.
GeoJSON se CSV — Ek GeoJSON FeatureCollection ko CSV mein aur wapas convert karein — Point features apni properties ke saath latitude/longitude columns bante hain.
Polyline Encoder — Coordinates ko Google polyline string mein encode karein ya use lat/lng aur GeoJSON mein decode karein.
KML se GeoJSON — KML ko GeoJSON mein aur wapas convert karein — Google Earth KML ko web maps ke liye GeoJSON banayein, ya GeoJSON ko wapas KML mein.