34 lines
No EOL
691 B
Text
34 lines
No EOL
691 B
Text
---
|
|
id: sweep-line
|
|
title: "Sweep Line"
|
|
author: Benjamin Qi
|
|
description: Introduction to line sweep.
|
|
---
|
|
|
|
## Sweep Line
|
|
|
|
<resources>
|
|
<resource source="CPH" title="30.1, 30.2 - Sweep Line Algorithms"></resource>
|
|
</resources>
|
|
|
|
### Tutorial
|
|
|
|
- CPH 30
|
|
- [TopCoder Line Sweep](https://www.topcoder.com/community/competitive-programming/tutorials/line-sweep-algorithms/)
|
|
|
|
## Closest Pair
|
|
|
|
- [Kattis Closest Pair](https://open.kattis.com/problems/closestpair2)
|
|
|
|
## Line Segment Intersection
|
|
|
|
- [Cow Steepchase II (Silver)](http://www.usaco.org/index.php?page=viewproblem2&cpid=943)
|
|
- :|
|
|
|
|
## Manhattan MST
|
|
|
|
https://open.kattis.com/problems/gridmst
|
|
|
|
CSA 84 The Sprawl
|
|
|
|
TC 760 ComponentsForever |