Vjylku

Multiplication via squaring and addition

Pure Functions: Does "No Side Effects" Imply "Always Same Output, Given Same Input"?

Should I choose Itemized or Standard deduction?

CBP Reminds Travelers to Allow 72 Hours for ESTA. Why?

How can I handle a player who pre-plans arguments about my rulings on RAW?

How to properly claim credit for peer review?

Is divide-by-zero a security vulnerability?

Linear regression when Y is bounded and discrete

What am I? I am in theaters and computer programs

Are small insurances worth it

Casually inserting sexuality

How do ISS astronauts "get their stripes"?

Does music exist in Panem? And if so, what kinds of music?

Is there a low-level alternative to Animate Objects?

How can atoms be electrically neutral when there is a difference in the positions of the charges?

How to count occurrences of Friday 13th

What type of postprocessing gives the effect of people standing out

I am on the US no-fly list. What can I do in order to be allowed on flights which go through US airspace?

How to tighten battery clamp?

Compare four integers, return word based on maximum

Significance and timing of "mux scans"

Which aircraft had such a luxurious-looking navigator's station?

When should a commit not be version tagged?

What can I substitute for soda pop in a sweet pork recipe?

Algorithm to optimally split a map comprising many separate areas into panels for printing

0

I have a map of set of land parcels (polygons) that need to inserted into a document. Some of these polygons are contiguous, but some can be scattered randomly. The area is typically too large for a one page map. So the map must be divided into several tiles/panels. Each tile/panel is of fixed scale and size, but the corner coordinate doesn't have to be on a fixed grid.

A naive approach is to use a regular grid and printing any tile that touches one of the polygons. However this leads to really sub-optimal results. For example if a polygon contains a grid corner you have 4 tiles when one tile could do the job.

The following image illustrates the problem: 4 tiles/panels should be sufficient to print this map, but the naive approach doubles that to 8. This will be fun algorithm figure out, but I'm sure this problem has been solved before. Any pointers (or even keywords to use in a search) would be appreciated.

printing mapping

share

asked 2 mins ago

jdesbonnetjdesbonnet

1

New contributor

jdesbonnet is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

add a comment | 

0

I have a map of set of land parcels (polygons) that need to inserted into a document. Some of these polygons are contiguous, but some can be scattered randomly. The area is typically too large for a one page map. So the map must be divided into several tiles/panels. Each tile/panel is of fixed scale and size, but the corner coordinate doesn't have to be on a fixed grid.

A naive approach is to use a regular grid and printing any tile that touches one of the polygons. However this leads to really sub-optimal results. For example if a polygon contains a grid corner you have 4 tiles when one tile could do the job.

The following image illustrates the problem: 4 tiles/panels should be sufficient to print this map, but the naive approach doubles that to 8. This will be fun algorithm figure out, but I'm sure this problem has been solved before. Any pointers (or even keywords to use in a search) would be appreciated.

printing mapping

share

asked 2 mins ago

jdesbonnetjdesbonnet

1

New contributor

jdesbonnet is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

add a comment | 

I have a map of set of land parcels (polygons) that need to inserted into a document. Some of these polygons are contiguous, but some can be scattered randomly. The area is typically too large for a one page map. So the map must be divided into several tiles/panels. Each tile/panel is of fixed scale and size, but the corner coordinate doesn't have to be on a fixed grid.

A naive approach is to use a regular grid and printing any tile that touches one of the polygons. However this leads to really sub-optimal results. For example if a polygon contains a grid corner you have 4 tiles when one tile could do the job.

The following image illustrates the problem: 4 tiles/panels should be sufficient to print this map, but the naive approach doubles that to 8. This will be fun algorithm figure out, but I'm sure this problem has been solved before. Any pointers (or even keywords to use in a search) would be appreciated.

printing mapping

share

asked 2 mins ago

jdesbonnetjdesbonnet

1

New contributor

jdesbonnet is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share

asked 2 mins ago

jdesbonnetjdesbonnet

1

New contributor

jdesbonnet is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share

asked 2 mins ago

jdesbonnetjdesbonnet

1

New contributor

jdesbonnet is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 2 mins ago

jdesbonnetjdesbonnet

1

New contributor

jdesbonnet is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 2 mins ago

jdesbonnetjdesbonnet

1