61 lines
1.2 KiB
Text
61 lines
1.2 KiB
Text
---
|
|
id: sweep-line
|
|
title: "Sweep Line"
|
|
author: Benjamin Qi
|
|
description: Introduction to line sweep.
|
|
prerequisites:
|
|
- geo-pri
|
|
frequency: 1
|
|
---
|
|
|
|
import { Problem } from "../models";
|
|
|
|
export const metadata = {
|
|
problems: {
|
|
closest: [
|
|
new Problem("Kattis", "Closest Pair", "closestpair2", "Normal", false, [], ""),
|
|
],
|
|
seg: [
|
|
new Problem("Silver", "Cow Steepchase II", "943", "Normal", false, [], ":|"),
|
|
],
|
|
manSam: [
|
|
new Problem("Kattis", "Grid MST", "gridmst", "Intro", false, [], ""),
|
|
],
|
|
man: [
|
|
new Problem("CSA", "The Sprawl", "the-sprawl", "Hard", false, [], ""),
|
|
]
|
|
}
|
|
};
|
|
|
|
(what's line sweep?)
|
|
|
|
<Resources>
|
|
<Resource source="CPH" title="30.1, 30.2 - Sweep Line Algorithms"></Resource>
|
|
<Resource source="TC" title="Line Sweep Algorithms" url="line-sweep-algorithms"></Resource>
|
|
</Resources>
|
|
|
|
## Closest Pair
|
|
|
|
<Problems problems={metadata.problems.closest} />
|
|
|
|
(explanation? KACTL?)
|
|
|
|
## Line Segment Intersection
|
|
|
|
(refer to previous module)
|
|
|
|
<Problems problems={metadata.problems.seg} />
|
|
|
|
(filling in the details?)
|
|
|
|
## Manhattan MST
|
|
|
|
<Problems problems={metadata.problems.manSam} />
|
|
|
|
(KACTL code)
|
|
|
|
explanation? topcoder prob has
|
|
|
|
<Problems problems={metadata.problems.man} />
|
|
|
|
TC 760 ComponentsForever |