feat: 引入可切换星历模型并扩展天象观测链路
- 新增半解析、旧模型、自定义与多源堆叠星历实例,提供 Context、Instance、SPK 读取及状态与视位置计算 - 统一太阳、月球和行星实例接口,扩展黄经穿越、留、相位、最近角距、偕日可见、任意高度升落、轨道节点及凌日等天象查询 - 完善日月食、月掩与凌日的月缘剖面、有限盘面接触、站心修正、局地可见性、全球路径和地图输出 - 新增 SVG、GeoJSON、KML 天象输出及凌日、月掩和月缘地形相关缓存与几何求解 - 新增恒星星表导入与查询,支持 CSV、Hipparcos、BSC5、Stellarium 等格式及名称、交叉标识、锥面检索和星等过滤 - 补充 IAU 2006、地球定向、折射消光、大气观测、轨道传播及半解析行星/月球数据支持 - 将默认未来民用时标切换为 TimeScaleLeapHour,更新 2027–2400 农历速查表、中文日期解析和时区边界处理 - 增加事件基线、跨模型回归、几何边界、月缘地形和输出契约测试,完善中英文手册、示例资源、NOTICE 与忽略规则
This commit is contained in:
+53
-14
@@ -1,6 +1,8 @@
|
||||
package basic
|
||||
|
||||
import (
|
||||
"math"
|
||||
|
||||
. "b612.me/astro/tools"
|
||||
)
|
||||
|
||||
@@ -148,29 +150,66 @@ func isCross(a, b, c, d constellationPoint) bool {
|
||||
}
|
||||
|
||||
func resolveConstellationCode(ra, dec, jde float64) string {
|
||||
var nra, ndec float64
|
||||
initConstellationData()
|
||||
nra = ra
|
||||
if ra >= 360 {
|
||||
nra -= 360
|
||||
}
|
||||
nra, ndec = Precess(nra, dec, jde, 2451545.0)
|
||||
if ra >= 360 && nra < 270 {
|
||||
nra += 360
|
||||
}
|
||||
if code := matchConstellationCode(nra, ndec); code != "" {
|
||||
code, nra, ndec := lookupConstellationCode(ra, dec, jde)
|
||||
if code != "" {
|
||||
return code
|
||||
}
|
||||
if nra <= 270 {
|
||||
ra = ra + 360
|
||||
return resolveConstellationCode(ra, dec, jde)
|
||||
// 只从 [0,360) 补一圈重试一次,匹配 RA 已加 360 的跨零点星座。
|
||||
if nra <= 270 && ra < 360 {
|
||||
if code, _, _ = lookupConstellationCode(ra+360, dec, jde); code != "" {
|
||||
return code
|
||||
}
|
||||
}
|
||||
if ndec > 50 {
|
||||
return "UMI"
|
||||
} else if ndec < -50 {
|
||||
return "OCT"
|
||||
}
|
||||
return ""
|
||||
if ra >= 360 {
|
||||
return ""
|
||||
}
|
||||
// 边界数据相邻多边形之间有细缝,落在缝里的点归最近的边。
|
||||
return nearestConstellationCode(nra, ndec)
|
||||
}
|
||||
|
||||
func lookupConstellationCode(ra, dec, jde float64) (string, float64, float64) {
|
||||
nra := ra
|
||||
if ra >= 360 {
|
||||
nra -= 360
|
||||
}
|
||||
nra, ndec := Precess(nra, dec, jde, 2451545.0)
|
||||
if ra >= 360 && nra < 270 {
|
||||
nra += 360
|
||||
}
|
||||
return matchConstellationCode(nra, ndec), nra, ndec
|
||||
}
|
||||
|
||||
func nearestConstellationCode(ra, dec float64) string {
|
||||
cosDec := math.Cos(dec * math.Pi / 180)
|
||||
best, bestDistance := "", math.Inf(1)
|
||||
for _, boundary := range constellationBoundaries {
|
||||
pointCount := len(boundary.points)
|
||||
for index := 0; index < pointCount; index++ {
|
||||
p, q := boundary.points[index], boundary.points[(index+1)%pointCount]
|
||||
px, py := math.Remainder(p.RA-ra, 360)*cosDec, p.DEC-dec
|
||||
qx, qy := math.Remainder(q.RA-ra, 360)*cosDec, q.DEC-dec
|
||||
if distance := originSegmentDistance(px, py, qx, qy); distance < bestDistance {
|
||||
best, bestDistance = boundary.code, distance
|
||||
}
|
||||
}
|
||||
}
|
||||
return best
|
||||
}
|
||||
|
||||
func originSegmentDistance(px, py, qx, qy float64) float64 {
|
||||
dx, dy := qx-px, qy-py
|
||||
length := dx*dx + dy*dy
|
||||
t := 0.0
|
||||
if length > 0 {
|
||||
t = math.Max(0, math.Min(1, -(px*dx+py*dy)/length))
|
||||
}
|
||||
return math.Hypot(px+t*dx, py+t*dy)
|
||||
}
|
||||
|
||||
func matchConstellationCode(ra, dec float64) string {
|
||||
|
||||
Reference in New Issue
Block a user