English 中文(简体)
在不断扩大的领域(地球)计算表面碎块(大陆)
原标题:Calculating surface fragments (continents) on an expanding sphere (Earth)

让我们的原地构造是错误的,我们的地球已随着时间的推移而扩大,各大陆曾经覆盖着一个较小的地球的整个表面,海洋地层是延伸的海龟,这是扩张的一种表现。

rel=“nofollow noreferer”http://earthexpansion.blogspot.com/02/syn光学-simplicity-again.html

难以想象在较小的地球上什么东西会看一看。 确实,有些人已视像化,但计算是什么?

不幸的是,我的经验完全是博尔·商业图表。 因此,在考虑是否发展诸如而开放,我甚至不知道如何解决这一问题。

鉴于今天的地表和几何数据——一个领域(种类)、地块(大陆、多角)——是否考虑到某些制约因素(洲际不能任意变形),有可能将地球重新测量到较小的面积,以便发现某一个特定的扩张动态是否具有几何意义?

你们怎样做呢? 概念、做法? 工具、技术? 地理数据来源?

Update

An important factor to take into account in reverse engineering the Earth to a former continental configuration on a smaller planet is the age of the ocean floors as measured by the U.S. Navy and others. As you can see on the map, the ocean floor is very young everywhere as compared to the continental crust. Moving back in time and deflating the planet, the youngest ocean floor stretches (red, at the spreading ridges) will have to be removed first because we know they weren t there.

“age

因此,这些测量大大限制了正在缩小的面积的地表重组问题。 然而,我对于在这样一个问题上使用地貌不知。

最佳回答

从我如何理解你的问题来看,今天所有大陆的表面面积在任何特定时间都是一样的,而地球的总表面面积随着时间的推移而缩小。 权利?

So the question is whether the continents can be placed on the Earth so that their total surface area does not exceed the total surface area of Earth for that moment in time. And there are some constraints to this problem: you cannot make the continents jump from one hemisphere to the other in a short period of time, for example. So you d have to take the incremental movement of continents into account.

.。 与此相关的最接近的问题是:Algorithm, 适合一个地区的2D综合工程? 但是,其他可能性(如,如果该理论允许,将一个大陆破碎成几条)使得它变得非常困难。

问题回答

暂无回答




相关问题
Bounding ellipse

I have been given an assignement for a graphics module, one part of which is to calculate the minimum bounding ellipse of a set of arbitrary shapes. The ellipse doesn t have to be axis aligned. This ...

Line segment in a triangle

How can we check if a line segment falls partially or fully inside a triangle? Cheers.

Line Segments from a point

I have a point p, and 2 line segments in a 2D plane. Point p is a location of view from where camera is looking towards the line segments. I want to check if line segment 1 is partially or fully ...

Creating a surface of triangles from a set of 2D points

I have a set of points and I need to convert the set to (non-overlapping) triangles (or a big polygon if equivalent)... The application: I have a list of locations (latitude,longitude) from a country,...

Radial plotting algorithm

I have to write an algorithm in AS3.0 that plots the location of points radially. I d like to input a radius and an angle at which the point should be placed. Obviously I remember from geometry ...

Delete holes in a Polygon

I have a polygon determined by an Array of Points. This polygon is crossing itself making some holes in the polygon itself. My questions is: How can I omit this holes and just get the exterior ...

Finding cycle of 3 nodes ( or triangles) in a graph

I am working with complex networks. I want to find group of nodes which forms a cycle of 3 nodes (or triangles) in a given graph. As my graph contains about million edges, using a simple iterative ...

热门标签